./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 974d17413865f39a607640a826612ee43ba82182a41f559c5bb885b5b3327e06
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-27 12:23:44,220 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-27 12:23:44,238 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-27 12:23:44,291 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-27 12:23:44,291 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-27 12:23:44,294 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-27 12:23:44,295 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-27 12:23:44,297 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-27 12:23:44,298 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-27 12:23:44,302 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-27 12:23:44,303 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-27 12:23:44,318 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-27 12:23:44,319 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-27 12:23:44,320 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-27 12:23:44,321 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-27 12:23:44,323 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-27 12:23:44,324 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-27 12:23:44,324 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-27 12:23:44,325 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-27 12:23:44,329 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-27 12:23:44,330 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-27 12:23:44,332 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-27 12:23:44,332 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-27 12:23:44,333 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-27 12:23:44,339 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-27 12:23:44,339 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-27 12:23:44,339 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-27 12:23:44,340 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-27 12:23:44,341 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-27 12:23:44,341 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-27 12:23:44,341 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-27 12:23:44,358 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-27 12:23:44,360 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-27 12:23:44,360 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-27 12:23:44,361 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-27 12:23:44,361 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-27 12:23:44,362 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-27 12:23:44,362 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-27 12:23:44,362 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-27 12:23:44,363 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-27 12:23:44,363 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-27 12:23:44,364 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-27 12:23:44,395 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-27 12:23:44,395 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-27 12:23:44,396 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-27 12:23:44,396 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-27 12:23:44,396 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-27 12:23:44,397 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-27 12:23:44,397 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-27 12:23:44,397 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-27 12:23:44,397 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-27 12:23:44,398 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-27 12:23:44,398 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-27 12:23:44,398 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-27 12:23:44,399 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-27 12:23:44,399 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-27 12:23:44,399 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-27 12:23:44,399 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-27 12:23:44,399 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-27 12:23:44,399 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-27 12:23:44,400 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-27 12:23:44,400 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-27 12:23:44,414 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-27 12:23:44,414 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-27 12:23:44,414 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-27 12:23:44,414 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-27 12:23:44,414 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-27 12:23:44,414 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-27 12:23:44,415 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:23:44,415 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-27 12:23:44,415 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-27 12:23:44,416 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-27 12:23:44,416 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-27 12:23:44,416 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-27 12:23:44,417 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-27 12:23:44,417 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-27 12:23:44,417 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-27 12:23:44,417 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-27 12:23:44,417 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-27 12:23:44,418 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 974d17413865f39a607640a826612ee43ba82182a41f559c5bb885b5b3327e06
[2023-10-27 12:23:44,826 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-27 12:23:44,848 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-27 12:23:44,850 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-27 12:23:44,866 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-27 12:23:44,866 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-27 12:23:44,867 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2023-10-27 12:23:46,568 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-27 12:23:46,993 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-27 12:23:46,993 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2023-10-27 12:23:47,023 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/66d34b914/513aa3d6850c44e881c79fc4b2833646/FLAG3b8273b8e
[2023-10-27 12:23:47,048 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/66d34b914/513aa3d6850c44e881c79fc4b2833646
[2023-10-27 12:23:47,050 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-27 12:23:47,051 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-27 12:23:47,054 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-27 12:23:47,054 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-27 12:23:47,056 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-27 12:23:47,070 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:23:47" (1/1) ...
[2023-10-27 12:23:47,071 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cc1908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:47, skipping insertion in model container
[2023-10-27 12:23:47,071 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:23:47" (1/1) ...
[2023-10-27 12:23:47,089 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-27 12:23:47,172 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-27 12:23:47,407 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:23:47,803 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2023-10-27 12:23:47,812 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:23:47,834 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-27 12:23:47,857 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:23:47,894 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2023-10-27 12:23:47,910 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:23:48,018 INFO  L208         MainTranslator]: Completed translation
[2023-10-27 12:23:48,019 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:48 WrapperNode
[2023-10-27 12:23:48,019 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-27 12:23:48,020 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-27 12:23:48,020 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-27 12:23:48,020 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-27 12:23:48,026 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:48" (1/1) ...
[2023-10-27 12:23:48,066 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:48" (1/1) ...
[2023-10-27 12:23:48,113 INFO  L138                Inliner]: procedures = 278, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 103
[2023-10-27 12:23:48,113 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-27 12:23:48,114 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-27 12:23:48,114 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-27 12:23:48,114 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-27 12:23:48,142 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:48" (1/1) ...
[2023-10-27 12:23:48,143 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:48" (1/1) ...
[2023-10-27 12:23:48,156 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:48" (1/1) ...
[2023-10-27 12:23:48,156 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:48" (1/1) ...
[2023-10-27 12:23:48,168 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:48" (1/1) ...
[2023-10-27 12:23:48,192 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:48" (1/1) ...
[2023-10-27 12:23:48,198 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:48" (1/1) ...
[2023-10-27 12:23:48,202 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:48" (1/1) ...
[2023-10-27 12:23:48,205 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-27 12:23:48,205 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-27 12:23:48,206 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-27 12:23:48,206 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-27 12:23:48,207 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:48" (1/1) ...
[2023-10-27 12:23:48,211 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:23:48,230 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:23:48,247 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-27 12:23:48,288 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-27 12:23:48,293 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-27 12:23:48,293 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-27 12:23:48,297 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-27 12:23:48,297 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-27 12:23:48,297 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-27 12:23:48,297 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-27 12:23:48,297 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-27 12:23:48,298 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2023-10-27 12:23:48,298 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-27 12:23:48,298 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-27 12:23:48,298 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-27 12:23:48,298 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-27 12:23:48,299 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-27 12:23:48,502 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-27 12:23:48,509 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-27 12:23:48,997 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-27 12:23:49,004 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-27 12:23:49,021 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-27 12:23:49,024 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:23:49 BoogieIcfgContainer
[2023-10-27 12:23:49,024 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-27 12:23:49,025 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-27 12:23:49,025 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-27 12:23:49,028 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-27 12:23:49,028 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:23:47" (1/3) ...
[2023-10-27 12:23:49,028 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200ca66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:23:49, skipping insertion in model container
[2023-10-27 12:23:49,029 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:23:48" (2/3) ...
[2023-10-27 12:23:49,030 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200ca66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:23:49, skipping insertion in model container
[2023-10-27 12:23:49,030 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:23:49" (3/3) ...
[2023-10-27 12:23:49,031 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i
[2023-10-27 12:23:49,048 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-27 12:23:49,056 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-27 12:23:49,057 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2023-10-27 12:23:49,057 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-27 12:23:49,188 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-27 12:23:49,254 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 306 flow
[2023-10-27 12:23:49,400 INFO  L130       PetriNetUnfolder]: 7/215 cut-off events.
[2023-10-27 12:23:49,400 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:23:49,413 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 221 conditions, 215 events. 7/215 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 413 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 108. Up to 4 conditions per place. 
[2023-10-27 12:23:49,413 INFO  L82        GeneralOperation]: Start removeDead. Operand has 147 places, 149 transitions, 306 flow
[2023-10-27 12:23:49,421 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 147 places, 149 transitions, 306 flow
[2023-10-27 12:23:49,423 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:23:49,457 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 149 transitions, 306 flow
[2023-10-27 12:23:49,462 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 149 transitions, 306 flow
[2023-10-27 12:23:49,463 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 306 flow
[2023-10-27 12:23:49,535 INFO  L130       PetriNetUnfolder]: 7/215 cut-off events.
[2023-10-27 12:23:49,541 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:23:49,543 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 221 conditions, 215 events. 7/215 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 413 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 108. Up to 4 conditions per place. 
[2023-10-27 12:23:49,546 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3942
[2023-10-27 12:23:52,878 INFO  L134        LiptonReduction]: Checked pairs total: 25074
[2023-10-27 12:23:52,885 INFO  L136        LiptonReduction]: Total number of compositions: 96
[2023-10-27 12:23:52,907 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:23:52,924 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@14e2fa8a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:23:52,925 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2023-10-27 12:23:52,926 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-10-27 12:23:52,927 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:23:52,927 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:23:52,928 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-27 12:23:52,929 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:23:52,933 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:23:52,934 INFO  L85        PathProgramCache]: Analyzing trace with hash 480, now seen corresponding path program 1 times
[2023-10-27 12:23:52,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:23:52,944 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823347766]
[2023-10-27 12:23:52,945 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:23:52,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:23:53,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:23:53,082 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:23:53,097 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:23:53,098 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823347766]
[2023-10-27 12:23:53,098 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823347766] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:23:53,098 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:23:53,099 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-27 12:23:53,100 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595536328]
[2023-10-27 12:23:53,100 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:23:53,106 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-27 12:23:53,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:23:53,151 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-27 12:23:53,152 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-27 12:23:53,155 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 245
[2023-10-27 12:23:53,159 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 142 flow. Second operand  has 2 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:53,159 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:23:53,159 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 245
[2023-10-27 12:23:53,160 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:23:53,310 INFO  L130       PetriNetUnfolder]: 85/397 cut-off events.
[2023-10-27 12:23:53,310 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-27 12:23:53,312 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 606 conditions, 397 events. 85/397 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2129 event pairs, 84 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 536. Up to 203 conditions per place. 
[2023-10-27 12:23:53,324 INFO  L137   encePairwiseOnDemand]: 244/245 looper letters, 23 selfloop transitions, 0 changer transitions 0/66 dead transitions.
[2023-10-27 12:23:53,325 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 186 flow
[2023-10-27 12:23:53,325 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-27 12:23:53,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-27 12:23:53,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 310 transitions.
[2023-10-27 12:23:53,356 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6326530612244898
[2023-10-27 12:23:53,357 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 310 transitions.
[2023-10-27 12:23:53,358 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 310 transitions.
[2023-10-27 12:23:53,360 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:23:53,362 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 310 transitions.
[2023-10-27 12:23:53,366 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 155.0) internal successors, (310), 2 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:53,372 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:53,372 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:53,374 INFO  L175             Difference]: Start difference. First operand has 69 places, 67 transitions, 142 flow. Second operand 2 states and 310 transitions.
[2023-10-27 12:23:53,374 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 186 flow
[2023-10-27 12:23:53,376 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:23:53,391 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 140 flow
[2023-10-27 12:23:53,393 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=140, PETRI_PLACES=69, PETRI_TRANSITIONS=66}
[2023-10-27 12:23:53,395 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places.
[2023-10-27 12:23:53,396 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 140 flow
[2023-10-27 12:23:53,397 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:53,397 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:23:53,397 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-27 12:23:53,398 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-27 12:23:53,398 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:23:53,400 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:23:53,401 INFO  L85        PathProgramCache]: Analyzing trace with hash 472525, now seen corresponding path program 1 times
[2023-10-27 12:23:53,401 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:23:53,401 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021049439]
[2023-10-27 12:23:53,402 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:23:53,402 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:23:53,468 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:23:53,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:23:53,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:23:53,613 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021049439]
[2023-10-27 12:23:53,613 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021049439] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:23:53,614 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:23:53,614 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:23:53,614 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202846726]
[2023-10-27 12:23:53,615 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:23:53,626 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:23:53,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:23:53,627 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:23:53,628 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:23:53,668 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 245
[2023-10-27 12:23:53,673 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 140 flow. Second operand  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:53,674 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:23:53,674 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 245
[2023-10-27 12:23:53,674 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:23:53,823 INFO  L130       PetriNetUnfolder]: 132/476 cut-off events.
[2023-10-27 12:23:53,824 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-27 12:23:53,826 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 797 conditions, 476 events. 132/476 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2444 event pairs, 67 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 793. Up to 172 conditions per place. 
[2023-10-27 12:23:53,828 INFO  L137   encePairwiseOnDemand]: 234/245 looper letters, 43 selfloop transitions, 8 changer transitions 0/88 dead transitions.
[2023-10-27 12:23:53,828 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 286 flow
[2023-10-27 12:23:53,829 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:23:53,829 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:23:53,845 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions.
[2023-10-27 12:23:53,846 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6122448979591837
[2023-10-27 12:23:53,846 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 450 transitions.
[2023-10-27 12:23:53,846 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions.
[2023-10-27 12:23:53,846 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:23:53,847 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions.
[2023-10-27 12:23:53,927 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:53,929 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:53,930 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:53,930 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 140 flow. Second operand 3 states and 450 transitions.
[2023-10-27 12:23:53,930 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 286 flow
[2023-10-27 12:23:53,931 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 88 transitions, 286 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:23:53,932 INFO  L231             Difference]: Finished difference. Result has 73 places, 74 transitions, 210 flow
[2023-10-27 12:23:53,932 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=73, PETRI_TRANSITIONS=74}
[2023-10-27 12:23:53,933 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 4 predicate places.
[2023-10-27 12:23:53,937 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 210 flow
[2023-10-27 12:23:53,937 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:53,937 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:23:53,938 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:23:53,938 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-27 12:23:53,938 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:23:53,938 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:23:53,939 INFO  L85        PathProgramCache]: Analyzing trace with hash 1738520444, now seen corresponding path program 1 times
[2023-10-27 12:23:53,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:23:53,939 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528041806]
[2023-10-27 12:23:53,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:23:53,939 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:23:53,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:23:54,144 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:23:54,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:23:54,144 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528041806]
[2023-10-27 12:23:54,144 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528041806] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:23:54,145 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:23:54,145 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-27 12:23:54,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925697316]
[2023-10-27 12:23:54,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:23:54,146 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-27 12:23:54,147 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:23:54,147 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-27 12:23:54,147 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-27 12:23:54,204 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 245
[2023-10-27 12:23:54,205 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 210 flow. Second operand  has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:54,206 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:23:54,206 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 245
[2023-10-27 12:23:54,206 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:23:54,373 INFO  L130       PetriNetUnfolder]: 104/565 cut-off events.
[2023-10-27 12:23:54,374 INFO  L131       PetriNetUnfolder]: For 92/94 co-relation queries the response was YES.
[2023-10-27 12:23:54,374 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 960 conditions, 565 events. 104/565 cut-off events. For 92/94 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3403 event pairs, 15 based on Foata normal form. 2/524 useless extension candidates. Maximal degree in co-relation 954. Up to 218 conditions per place. 
[2023-10-27 12:23:54,376 INFO  L137   encePairwiseOnDemand]: 241/245 looper letters, 41 selfloop transitions, 3 changer transitions 1/91 dead transitions.
[2023-10-27 12:23:54,389 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 91 transitions, 350 flow
[2023-10-27 12:23:54,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-27 12:23:54,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-27 12:23:54,391 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 585 transitions.
[2023-10-27 12:23:54,391 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5969387755102041
[2023-10-27 12:23:54,391 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 585 transitions.
[2023-10-27 12:23:54,391 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 585 transitions.
[2023-10-27 12:23:54,392 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:23:54,392 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 585 transitions.
[2023-10-27 12:23:54,393 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:54,396 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:54,396 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:54,396 INFO  L175             Difference]: Start difference. First operand has 73 places, 74 transitions, 210 flow. Second operand 4 states and 585 transitions.
[2023-10-27 12:23:54,396 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 91 transitions, 350 flow
[2023-10-27 12:23:54,401 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:23:54,403 INFO  L231             Difference]: Finished difference. Result has 76 places, 75 transitions, 210 flow
[2023-10-27 12:23:54,403 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=76, PETRI_TRANSITIONS=75}
[2023-10-27 12:23:54,404 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 7 predicate places.
[2023-10-27 12:23:54,404 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 210 flow
[2023-10-27 12:23:54,405 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:54,405 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:23:54,405 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:23:54,405 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-27 12:23:54,408 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:23:54,409 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:23:54,409 INFO  L85        PathProgramCache]: Analyzing trace with hash -1699318889, now seen corresponding path program 1 times
[2023-10-27 12:23:54,409 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:23:54,409 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144828095]
[2023-10-27 12:23:54,409 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:23:54,410 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:23:54,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:23:54,874 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:23:54,874 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:23:54,874 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144828095]
[2023-10-27 12:23:54,875 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144828095] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:23:54,875 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:23:54,875 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:23:54,875 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712079978]
[2023-10-27 12:23:54,875 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:23:54,876 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:23:54,876 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:23:54,877 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:23:54,877 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:23:55,073 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 245
[2023-10-27 12:23:55,074 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 210 flow. Second operand  has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:55,074 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:23:55,074 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 245
[2023-10-27 12:23:55,074 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:23:55,455 INFO  L130       PetriNetUnfolder]: 395/1189 cut-off events.
[2023-10-27 12:23:55,455 INFO  L131       PetriNetUnfolder]: For 92/95 co-relation queries the response was YES.
[2023-10-27 12:23:55,456 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 1189 events. 395/1189 cut-off events. For 92/95 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7813 event pairs, 125 based on Foata normal form. 0/1144 useless extension candidates. Maximal degree in co-relation 2343. Up to 524 conditions per place. 
[2023-10-27 12:23:55,460 INFO  L137   encePairwiseOnDemand]: 222/245 looper letters, 88 selfloop transitions, 29 changer transitions 0/143 dead transitions.
[2023-10-27 12:23:55,460 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 143 transitions, 606 flow
[2023-10-27 12:23:55,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:23:55,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:23:55,462 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 822 transitions.
[2023-10-27 12:23:55,478 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5591836734693878
[2023-10-27 12:23:55,478 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 822 transitions.
[2023-10-27 12:23:55,478 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 822 transitions.
[2023-10-27 12:23:55,479 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:23:55,479 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 822 transitions.
[2023-10-27 12:23:55,481 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:55,483 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:55,483 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:55,484 INFO  L175             Difference]: Start difference. First operand has 76 places, 75 transitions, 210 flow. Second operand 6 states and 822 transitions.
[2023-10-27 12:23:55,484 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 143 transitions, 606 flow
[2023-10-27 12:23:55,486 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 143 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:23:55,489 INFO  L231             Difference]: Finished difference. Result has 85 places, 104 transitions, 428 flow
[2023-10-27 12:23:55,489 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=428, PETRI_PLACES=85, PETRI_TRANSITIONS=104}
[2023-10-27 12:23:55,490 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 16 predicate places.
[2023-10-27 12:23:55,490 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 104 transitions, 428 flow
[2023-10-27 12:23:55,491 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:55,491 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:23:55,491 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:23:55,491 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-27 12:23:55,491 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:23:55,492 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:23:55,492 INFO  L85        PathProgramCache]: Analyzing trace with hash 120947037, now seen corresponding path program 1 times
[2023-10-27 12:23:55,492 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:23:55,492 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161520952]
[2023-10-27 12:23:55,492 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:23:55,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:23:55,515 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:23:55,527 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:23:55,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:23:55,528 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161520952]
[2023-10-27 12:23:55,528 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161520952] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:23:55,529 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:23:55,529 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:23:55,541 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302579396]
[2023-10-27 12:23:55,541 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:23:55,542 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:23:55,542 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:23:55,542 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:23:55,542 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:23:55,566 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 245
[2023-10-27 12:23:55,566 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 104 transitions, 428 flow. Second operand  has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:55,566 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:23:55,567 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 245
[2023-10-27 12:23:55,567 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:23:55,757 INFO  L130       PetriNetUnfolder]: 206/854 cut-off events.
[2023-10-27 12:23:55,757 INFO  L131       PetriNetUnfolder]: For 246/261 co-relation queries the response was YES.
[2023-10-27 12:23:55,758 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 854 events. 206/854 cut-off events. For 246/261 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5761 event pairs, 90 based on Foata normal form. 3/834 useless extension candidates. Maximal degree in co-relation 1942. Up to 353 conditions per place. 
[2023-10-27 12:23:55,761 INFO  L137   encePairwiseOnDemand]: 240/245 looper letters, 39 selfloop transitions, 6 changer transitions 0/114 dead transitions.
[2023-10-27 12:23:55,761 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 114 transitions, 548 flow
[2023-10-27 12:23:55,761 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:23:55,761 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:23:55,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions.
[2023-10-27 12:23:55,762 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5904761904761905
[2023-10-27 12:23:55,762 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 434 transitions.
[2023-10-27 12:23:55,762 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions.
[2023-10-27 12:23:55,763 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:23:55,763 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions.
[2023-10-27 12:23:55,764 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:55,778 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:55,779 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:55,779 INFO  L175             Difference]: Start difference. First operand has 85 places, 104 transitions, 428 flow. Second operand 3 states and 434 transitions.
[2023-10-27 12:23:55,779 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 114 transitions, 548 flow
[2023-10-27 12:23:55,782 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 114 transitions, 548 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:23:55,785 INFO  L231             Difference]: Finished difference. Result has 88 places, 108 transitions, 470 flow
[2023-10-27 12:23:55,785 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=88, PETRI_TRANSITIONS=108}
[2023-10-27 12:23:55,787 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 19 predicate places.
[2023-10-27 12:23:55,787 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 108 transitions, 470 flow
[2023-10-27 12:23:55,787 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:55,787 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:23:55,787 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:23:55,787 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-27 12:23:55,788 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:23:55,788 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:23:55,788 INFO  L85        PathProgramCache]: Analyzing trace with hash -957762772, now seen corresponding path program 1 times
[2023-10-27 12:23:55,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:23:55,788 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425612876]
[2023-10-27 12:23:55,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:23:55,789 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:23:55,819 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:23:55,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:23:55,841 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:23:55,841 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425612876]
[2023-10-27 12:23:55,842 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425612876] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:23:55,842 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:23:55,842 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:23:55,842 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63879814]
[2023-10-27 12:23:55,842 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:23:55,843 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:23:55,843 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:23:55,844 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:23:55,847 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:23:55,868 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 245
[2023-10-27 12:23:55,868 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 108 transitions, 470 flow. Second operand  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:55,868 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:23:55,869 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 245
[2023-10-27 12:23:55,869 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:23:56,036 INFO  L130       PetriNetUnfolder]: 221/839 cut-off events.
[2023-10-27 12:23:56,037 INFO  L131       PetriNetUnfolder]: For 364/387 co-relation queries the response was YES.
[2023-10-27 12:23:56,038 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 839 events. 221/839 cut-off events. For 364/387 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5449 event pairs, 32 based on Foata normal form. 23/838 useless extension candidates. Maximal degree in co-relation 2026. Up to 361 conditions per place. 
[2023-10-27 12:23:56,054 INFO  L137   encePairwiseOnDemand]: 241/245 looper letters, 46 selfloop transitions, 2 changer transitions 1/119 dead transitions.
[2023-10-27 12:23:56,055 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 119 transitions, 612 flow
[2023-10-27 12:23:56,055 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:23:56,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:23:56,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions.
[2023-10-27 12:23:56,056 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6095238095238096
[2023-10-27 12:23:56,057 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 448 transitions.
[2023-10-27 12:23:56,057 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions.
[2023-10-27 12:23:56,057 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:23:56,057 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions.
[2023-10-27 12:23:56,058 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:56,059 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:56,060 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:56,060 INFO  L175             Difference]: Start difference. First operand has 88 places, 108 transitions, 470 flow. Second operand 3 states and 448 transitions.
[2023-10-27 12:23:56,060 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 119 transitions, 612 flow
[2023-10-27 12:23:56,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 119 transitions, 604 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:23:56,064 INFO  L231             Difference]: Finished difference. Result has 88 places, 107 transitions, 468 flow
[2023-10-27 12:23:56,064 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=88, PETRI_TRANSITIONS=107}
[2023-10-27 12:23:56,071 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 19 predicate places.
[2023-10-27 12:23:56,071 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 107 transitions, 468 flow
[2023-10-27 12:23:56,072 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:56,072 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:23:56,072 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:23:56,072 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-27 12:23:56,072 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:23:56,072 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:23:56,073 INFO  L85        PathProgramCache]: Analyzing trace with hash -949124360, now seen corresponding path program 1 times
[2023-10-27 12:23:56,073 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:23:56,080 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558229138]
[2023-10-27 12:23:56,080 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:23:56,081 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:23:56,115 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:23:56,637 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:23:56,638 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:23:56,640 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558229138]
[2023-10-27 12:23:56,641 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558229138] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:23:56,642 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:23:56,642 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:23:56,642 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148628168]
[2023-10-27 12:23:56,642 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:23:56,642 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:23:56,643 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:23:56,643 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:23:56,643 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:23:56,794 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 245
[2023-10-27 12:23:56,795 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 107 transitions, 468 flow. Second operand  has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:56,795 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:23:56,795 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 245
[2023-10-27 12:23:56,796 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:23:57,421 INFO  L130       PetriNetUnfolder]: 565/1518 cut-off events.
[2023-10-27 12:23:57,421 INFO  L131       PetriNetUnfolder]: For 805/819 co-relation queries the response was YES.
[2023-10-27 12:23:57,424 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4215 conditions, 1518 events. 565/1518 cut-off events. For 805/819 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10302 event pairs, 170 based on Foata normal form. 2/1446 useless extension candidates. Maximal degree in co-relation 4201. Up to 966 conditions per place. 
[2023-10-27 12:23:57,428 INFO  L137   encePairwiseOnDemand]: 222/245 looper letters, 127 selfloop transitions, 85 changer transitions 0/241 dead transitions.
[2023-10-27 12:23:57,447 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 241 transitions, 1452 flow
[2023-10-27 12:23:57,448 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:23:57,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:23:57,455 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 857 transitions.
[2023-10-27 12:23:57,456 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5829931972789115
[2023-10-27 12:23:57,456 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 857 transitions.
[2023-10-27 12:23:57,456 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 857 transitions.
[2023-10-27 12:23:57,457 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:23:57,457 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 857 transitions.
[2023-10-27 12:23:57,459 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:57,460 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:57,468 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:57,468 INFO  L175             Difference]: Start difference. First operand has 88 places, 107 transitions, 468 flow. Second operand 6 states and 857 transitions.
[2023-10-27 12:23:57,468 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 241 transitions, 1452 flow
[2023-10-27 12:23:57,474 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 241 transitions, 1436 flow, removed 5 selfloop flow, removed 2 redundant places.
[2023-10-27 12:23:57,494 INFO  L231             Difference]: Finished difference. Result has 95 places, 188 transitions, 1212 flow
[2023-10-27 12:23:57,494 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1212, PETRI_PLACES=95, PETRI_TRANSITIONS=188}
[2023-10-27 12:23:57,495 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places.
[2023-10-27 12:23:57,495 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 188 transitions, 1212 flow
[2023-10-27 12:23:57,496 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:57,496 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:23:57,496 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:23:57,496 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-27 12:23:57,496 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:23:57,497 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:23:57,497 INFO  L85        PathProgramCache]: Analyzing trace with hash 1013407062, now seen corresponding path program 1 times
[2023-10-27 12:23:57,497 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:23:57,497 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766329486]
[2023-10-27 12:23:57,497 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:23:57,497 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:23:57,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:23:58,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:23:58,115 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:23:58,115 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766329486]
[2023-10-27 12:23:58,115 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766329486] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:23:58,115 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:23:58,115 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-27 12:23:58,115 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087609789]
[2023-10-27 12:23:58,116 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:23:58,116 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-27 12:23:58,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:23:58,117 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-27 12:23:58,117 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-27 12:23:58,539 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 245
[2023-10-27 12:23:58,540 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 188 transitions, 1212 flow. Second operand  has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:58,540 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:23:58,540 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 245
[2023-10-27 12:23:58,540 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:23:58,884 INFO  L130       PetriNetUnfolder]: 524/1426 cut-off events.
[2023-10-27 12:23:58,897 INFO  L131       PetriNetUnfolder]: For 1458/1470 co-relation queries the response was YES.
[2023-10-27 12:23:58,900 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5013 conditions, 1426 events. 524/1426 cut-off events. For 1458/1470 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 9589 event pairs, 212 based on Foata normal form. 39/1421 useless extension candidates. Maximal degree in co-relation 4995. Up to 1052 conditions per place. 
[2023-10-27 12:23:58,905 INFO  L137   encePairwiseOnDemand]: 236/245 looper letters, 158 selfloop transitions, 7 changer transitions 1/209 dead transitions.
[2023-10-27 12:23:58,905 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 209 transitions, 1668 flow
[2023-10-27 12:23:58,905 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-27 12:23:58,906 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-27 12:23:58,907 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions.
[2023-10-27 12:23:58,908 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5102040816326531
[2023-10-27 12:23:58,908 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 875 transitions.
[2023-10-27 12:23:58,908 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions.
[2023-10-27 12:23:58,908 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:23:58,908 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions.
[2023-10-27 12:23:58,910 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:58,912 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:58,925 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:58,926 INFO  L175             Difference]: Start difference. First operand has 95 places, 188 transitions, 1212 flow. Second operand 7 states and 875 transitions.
[2023-10-27 12:23:58,926 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 209 transitions, 1668 flow
[2023-10-27 12:23:59,049 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 209 transitions, 1614 flow, removed 27 selfloop flow, removed 0 redundant places.
[2023-10-27 12:23:59,052 INFO  L231             Difference]: Finished difference. Result has 102 places, 189 transitions, 1208 flow
[2023-10-27 12:23:59,052 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1208, PETRI_PLACES=102, PETRI_TRANSITIONS=189}
[2023-10-27 12:23:59,054 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 33 predicate places.
[2023-10-27 12:23:59,054 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 189 transitions, 1208 flow
[2023-10-27 12:23:59,055 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:59,055 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:23:59,055 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:23:59,055 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-27 12:23:59,057 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:23:59,057 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:23:59,057 INFO  L85        PathProgramCache]: Analyzing trace with hash -1627961114, now seen corresponding path program 1 times
[2023-10-27 12:23:59,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:23:59,058 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874272766]
[2023-10-27 12:23:59,058 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:23:59,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:23:59,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:23:59,650 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:23:59,650 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:23:59,650 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874272766]
[2023-10-27 12:23:59,651 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874272766] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:23:59,651 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:23:59,651 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-27 12:23:59,651 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510059551]
[2023-10-27 12:23:59,651 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:23:59,652 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-27 12:23:59,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:23:59,652 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-27 12:23:59,652 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-27 12:24:00,062 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245
[2023-10-27 12:24:00,063 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 189 transitions, 1208 flow. Second operand  has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:00,063 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:00,064 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245
[2023-10-27 12:24:00,064 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:00,614 INFO  L130       PetriNetUnfolder]: 540/1423 cut-off events.
[2023-10-27 12:24:00,614 INFO  L131       PetriNetUnfolder]: For 1470/1481 co-relation queries the response was YES.
[2023-10-27 12:24:00,617 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5119 conditions, 1423 events. 540/1423 cut-off events. For 1470/1481 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9344 event pairs, 165 based on Foata normal form. 33/1409 useless extension candidates. Maximal degree in co-relation 5096. Up to 634 conditions per place. 
[2023-10-27 12:24:00,646 INFO  L137   encePairwiseOnDemand]: 232/245 looper letters, 254 selfloop transitions, 62 changer transitions 1/343 dead transitions.
[2023-10-27 12:24:00,646 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 343 transitions, 2754 flow
[2023-10-27 12:24:00,647 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-27 12:24:00,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-27 12:24:00,648 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1078 transitions.
[2023-10-27 12:24:00,649 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.55
[2023-10-27 12:24:00,649 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1078 transitions.
[2023-10-27 12:24:00,649 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1078 transitions.
[2023-10-27 12:24:00,650 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:00,650 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1078 transitions.
[2023-10-27 12:24:00,651 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 134.75) internal successors, (1078), 8 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:00,654 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:00,654 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:00,654 INFO  L175             Difference]: Start difference. First operand has 102 places, 189 transitions, 1208 flow. Second operand 8 states and 1078 transitions.
[2023-10-27 12:24:00,654 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 343 transitions, 2754 flow
[2023-10-27 12:24:00,664 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 343 transitions, 2724 flow, removed 4 selfloop flow, removed 2 redundant places.
[2023-10-27 12:24:00,680 INFO  L231             Difference]: Finished difference. Result has 114 places, 216 transitions, 1638 flow
[2023-10-27 12:24:00,680 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1638, PETRI_PLACES=114, PETRI_TRANSITIONS=216}
[2023-10-27 12:24:00,681 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 45 predicate places.
[2023-10-27 12:24:00,681 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 216 transitions, 1638 flow
[2023-10-27 12:24:00,682 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:00,682 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:00,682 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:00,682 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-27 12:24:00,682 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:00,683 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:00,683 INFO  L85        PathProgramCache]: Analyzing trace with hash -776168387, now seen corresponding path program 1 times
[2023-10-27 12:24:00,683 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:24:00,684 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715809186]
[2023-10-27 12:24:00,684 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:00,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:24:00,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:00,752 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:24:00,752 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:24:00,754 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715809186]
[2023-10-27 12:24:00,754 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715809186] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:24:00,754 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:24:00,754 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:24:00,754 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915487480]
[2023-10-27 12:24:00,754 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:24:00,755 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:24:00,755 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:24:00,755 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:24:00,756 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:24:00,773 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 245
[2023-10-27 12:24:00,774 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 216 transitions, 1638 flow. Second operand  has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:00,774 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:00,774 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 245
[2023-10-27 12:24:00,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:01,055 INFO  L130       PetriNetUnfolder]: 407/1207 cut-off events.
[2023-10-27 12:24:01,055 INFO  L131       PetriNetUnfolder]: For 3288/3310 co-relation queries the response was YES.
[2023-10-27 12:24:01,058 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4814 conditions, 1207 events. 407/1207 cut-off events. For 3288/3310 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7975 event pairs, 93 based on Foata normal form. 6/1169 useless extension candidates. Maximal degree in co-relation 4785. Up to 449 conditions per place. 
[2023-10-27 12:24:01,077 INFO  L137   encePairwiseOnDemand]: 239/245 looper letters, 46 selfloop transitions, 10 changer transitions 28/233 dead transitions.
[2023-10-27 12:24:01,077 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 233 transitions, 1857 flow
[2023-10-27 12:24:01,077 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:24:01,077 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:24:01,078 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions.
[2023-10-27 12:24:01,078 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6
[2023-10-27 12:24:01,079 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 441 transitions.
[2023-10-27 12:24:01,079 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions.
[2023-10-27 12:24:01,079 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:01,079 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions.
[2023-10-27 12:24:01,080 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:01,081 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:01,081 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:01,081 INFO  L175             Difference]: Start difference. First operand has 114 places, 216 transitions, 1638 flow. Second operand 3 states and 441 transitions.
[2023-10-27 12:24:01,081 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 233 transitions, 1857 flow
[2023-10-27 12:24:01,096 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 233 transitions, 1853 flow, removed 2 selfloop flow, removed 0 redundant places.
[2023-10-27 12:24:01,111 INFO  L231             Difference]: Finished difference. Result has 117 places, 199 transitions, 1501 flow
[2023-10-27 12:24:01,112 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1501, PETRI_PLACES=117, PETRI_TRANSITIONS=199}
[2023-10-27 12:24:01,113 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 48 predicate places.
[2023-10-27 12:24:01,117 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 199 transitions, 1501 flow
[2023-10-27 12:24:01,117 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:01,117 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:01,118 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:01,118 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-27 12:24:01,118 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:01,118 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:01,119 INFO  L85        PathProgramCache]: Analyzing trace with hash -1511156484, now seen corresponding path program 1 times
[2023-10-27 12:24:01,119 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:24:01,119 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382255247]
[2023-10-27 12:24:01,119 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:01,119 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:24:01,158 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:01,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:24:01,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:24:01,494 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382255247]
[2023-10-27 12:24:01,494 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382255247] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:24:01,509 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:24:01,509 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:24:01,510 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553264096]
[2023-10-27 12:24:01,510 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:24:01,510 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:24:01,510 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:24:01,510 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:24:01,511 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:24:01,775 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 245
[2023-10-27 12:24:01,776 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 199 transitions, 1501 flow. Second operand  has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:01,776 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:01,776 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 245
[2023-10-27 12:24:01,776 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:02,289 INFO  L130       PetriNetUnfolder]: 476/1312 cut-off events.
[2023-10-27 12:24:02,290 INFO  L131       PetriNetUnfolder]: For 3861/3912 co-relation queries the response was YES.
[2023-10-27 12:24:02,293 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5592 conditions, 1312 events. 476/1312 cut-off events. For 3861/3912 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8483 event pairs, 121 based on Foata normal form. 13/1287 useless extension candidates. Maximal degree in co-relation 5561. Up to 718 conditions per place. 
[2023-10-27 12:24:02,297 INFO  L137   encePairwiseOnDemand]: 234/245 looper letters, 92 selfloop transitions, 41 changer transitions 35/265 dead transitions.
[2023-10-27 12:24:02,312 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 265 transitions, 2356 flow
[2023-10-27 12:24:02,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:24:02,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:24:02,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 847 transitions.
[2023-10-27 12:24:02,314 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5761904761904761
[2023-10-27 12:24:02,314 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 847 transitions.
[2023-10-27 12:24:02,314 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 847 transitions.
[2023-10-27 12:24:02,315 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:02,315 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 847 transitions.
[2023-10-27 12:24:02,316 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 141.16666666666666) internal successors, (847), 6 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:02,318 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:02,318 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:02,319 INFO  L175             Difference]: Start difference. First operand has 117 places, 199 transitions, 1501 flow. Second operand 6 states and 847 transitions.
[2023-10-27 12:24:02,319 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 265 transitions, 2356 flow
[2023-10-27 12:24:02,354 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 265 transitions, 2329 flow, removed 1 selfloop flow, removed 4 redundant places.
[2023-10-27 12:24:02,357 INFO  L231             Difference]: Finished difference. Result has 122 places, 222 transitions, 1887 flow
[2023-10-27 12:24:02,357 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1887, PETRI_PLACES=122, PETRI_TRANSITIONS=222}
[2023-10-27 12:24:02,357 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 53 predicate places.
[2023-10-27 12:24:02,357 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 222 transitions, 1887 flow
[2023-10-27 12:24:02,358 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:02,358 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:02,358 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:02,358 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-27 12:24:02,358 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:02,359 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:02,359 INFO  L85        PathProgramCache]: Analyzing trace with hash 880579718, now seen corresponding path program 1 times
[2023-10-27 12:24:02,359 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:24:02,362 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045437542]
[2023-10-27 12:24:02,362 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:02,362 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:24:02,404 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:24:02,404 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-27 12:24:02,439 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:24:02,479 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-27 12:24:02,493 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-27 12:24:02,494 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining)
[2023-10-27 12:24:02,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2023-10-27 12:24:02,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2023-10-27 12:24:02,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2023-10-27 12:24:02,497 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2023-10-27 12:24:02,498 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2023-10-27 12:24:02,498 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2023-10-27 12:24:02,498 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2023-10-27 12:24:02,498 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2023-10-27 12:24:02,498 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining)
[2023-10-27 12:24:02,498 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2023-10-27 12:24:02,499 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2023-10-27 12:24:02,499 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2023-10-27 12:24:02,499 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2023-10-27 12:24:02,499 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2023-10-27 12:24:02,499 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2023-10-27 12:24:02,500 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2023-10-27 12:24:02,500 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2023-10-27 12:24:02,500 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-27 12:24:02,500 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:02,505 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-10-27 12:24:02,505 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-10-27 12:24:02,590 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:24:02 BasicIcfg
[2023-10-27 12:24:02,590 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-10-27 12:24:02,591 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-10-27 12:24:02,591 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-10-27 12:24:02,591 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-10-27 12:24:02,592 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:23:49" (3/4) ...
[2023-10-27 12:24:02,594 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-10-27 12:24:02,594 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-10-27 12:24:02,595 INFO  L158              Benchmark]: Toolchain (without parser) took 15543.44ms. Allocated memory was 44.7MB in the beginning and 90.2MB in the end (delta: 45.5MB). Free memory was 13.9MB in the beginning and 36.4MB in the end (delta: -22.5MB). Peak memory consumption was 22.9MB. Max. memory is 15.6GB.
[2023-10-27 12:24:02,595 INFO  L158              Benchmark]: CDTParser took 0.15ms. Allocated memory is still 40.8MB. Free memory was 15.4MB in the beginning and 15.4MB in the end (delta: 28.2kB). Peak memory consumption was 28.2kB. Max. memory is 15.6GB.
[2023-10-27 12:24:02,595 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 965.46ms. Allocated memory is still 44.7MB. Free memory was 13.7MB in the beginning and 17.5MB in the end (delta: -3.9MB). Peak memory consumption was 4.8MB. Max. memory is 15.6GB.
[2023-10-27 12:24:02,595 INFO  L158              Benchmark]: Boogie Procedure Inliner took 93.53ms. Allocated memory is still 44.7MB. Free memory was 17.3MB in the beginning and 14.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.7MB. Max. memory is 15.6GB.
[2023-10-27 12:24:02,596 INFO  L158              Benchmark]: Boogie Preprocessor took 90.85ms. Allocated memory is still 44.7MB. Free memory was 14.6MB in the beginning and 12.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 15.6GB.
[2023-10-27 12:24:02,596 INFO  L158              Benchmark]: RCFGBuilder took 818.59ms. Allocated memory is still 44.7MB. Free memory was 12.5MB in the beginning and 17.1MB in the end (delta: -4.6MB). Peak memory consumption was 6.2MB. Max. memory is 15.6GB.
[2023-10-27 12:24:02,596 INFO  L158              Benchmark]: TraceAbstraction took 13564.97ms. Allocated memory was 44.7MB in the beginning and 90.2MB in the end (delta: 45.5MB). Free memory was 16.4MB in the beginning and 36.9MB in the end (delta: -20.5MB). Peak memory consumption was 25.0MB. Max. memory is 15.6GB.
[2023-10-27 12:24:02,597 INFO  L158              Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 90.2MB. Free memory was 36.9MB in the beginning and 36.4MB in the end (delta: 510.4kB). Peak memory consumption was 510.4kB. Max. memory is 15.6GB.
[2023-10-27 12:24:02,599 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.15ms. Allocated memory is still 40.8MB. Free memory was 15.4MB in the beginning and 15.4MB in the end (delta: 28.2kB). Peak memory consumption was 28.2kB. Max. memory is 15.6GB.
 * CACSL2BoogieTranslator took 965.46ms. Allocated memory is still 44.7MB. Free memory was 13.7MB in the beginning and 17.5MB in the end (delta: -3.9MB). Peak memory consumption was 4.8MB. Max. memory is 15.6GB.
 * Boogie Procedure Inliner took 93.53ms. Allocated memory is still 44.7MB. Free memory was 17.3MB in the beginning and 14.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.7MB. Max. memory is 15.6GB.
 * Boogie Preprocessor took 90.85ms. Allocated memory is still 44.7MB. Free memory was 14.6MB in the beginning and 12.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 15.6GB.
 * RCFGBuilder took 818.59ms. Allocated memory is still 44.7MB. Free memory was 12.5MB in the beginning and 17.1MB in the end (delta: -4.6MB). Peak memory consumption was 6.2MB. Max. memory is 15.6GB.
 * TraceAbstraction took 13564.97ms. Allocated memory was 44.7MB in the beginning and 90.2MB in the end (delta: 45.5MB). Free memory was 16.4MB in the beginning and 36.9MB in the end (delta: -20.5MB). Peak memory consumption was 25.0MB. Max. memory is 15.6GB.
 * Witness Printer took 3.39ms. Allocated memory is still 90.2MB. Free memory was 36.9MB in the beginning and 36.4MB in the end (delta: 510.4kB). Peak memory consumption was 510.4kB. Max. memory is 15.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 3.4s, 147 PlacesBefore, 69 PlacesAfterwards, 149 TransitionsBefore, 67 TransitionsAfterwards, 3942 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 96 TotalNumberOfCompositions, 25074 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5875, independent: 5008, independent conditional: 0, independent unconditional: 5008, dependent: 867, dependent conditional: 0, dependent unconditional: 867, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1716, independent: 1611, independent conditional: 0, independent unconditional: 1611, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5875, independent: 3397, independent conditional: 0, independent unconditional: 3397, dependent: 762, dependent conditional: 0, dependent unconditional: 762, unknown: 1716, unknown conditional: 0, unknown unconditional: 1716] , Statistics on independence cache: Total cache size (in pairs): 373, Positive cache size: 319, Positive conditional cache size: 0, Positive unconditional cache size: 319, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - UnprovableResult [Line: 1052]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: overapproximation of shiftLeft at line 1042, overapproximation of bitwiseOr at line 1042, overapproximation of bitwiseAnd at line 1053, overapproximation of bitwiseComplement at line 1053. 
Possible FailurePath: 
[L1037]               0  int threads_mask = -1;
[L1038]               0  int *datas;
[L1046]               0  int threads_total = __VERIFIER_nondet_int();
[L1047]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L1034]  COND FALSE   0  !(!cond)
[L1047]  RET          0  assume_abort_if_not(threads_total >= 0)
[L1048]  CALL         0  assume_abort_if_not(threads_total < 32)
[L1034]  COND FALSE   0  !(!cond)
[L1048]  RET          0  assume_abort_if_not(threads_total < 32)
[L1049]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1049]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1050]               0  datas = malloc(threads_total * sizeof(int))
[L1051]               0  int i = 0;
         VAL             [datas={-2:0}, i=0, threads_mask=-1, threads_total=31, tids={8:0}]
[L1051]  COND TRUE    0  i < threads_total
[L1052]  EXPR         0  ffs(threads_mask)
[L1052]               0  int j = ffs(threads_mask) - 1;
[L1053]               0  threads_mask &= ~(1 << j)
[L1054]  EXPR         0  \read(*tids)
         VAL             [\read(*tids)={-3:0}, datas={-2:0}, i=0, j=3, pthread_create(&tids[i], ((void *)0), &thread, j)=-4, threads_mask=-1, threads_total=31, tids={8:0}]
[L1054]  EXPR         0  tids[i]
         VAL             [\read(*tids)={-3:0}, datas={-2:0}, i=0, j=3, pthread_create(&tids[i], ((void *)0), &thread, j)=-4, threads_mask=-1, threads_total=31, tids={8:0}]
[L1054]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, j)
         VAL             [\read(*tids)={-3:0}, arg={0:3}, datas={-2:0}, i=0, j=3, pthread_create(&tids[i], ((void *)0), &thread, j)=-4, threads_mask=-1, threads_total=31, tids={8:0}]
[L1040]               1  int j = arg;
[L1041]  EXPR         1  datas[j]
         VAL             [arg={0:3}, arg={0:3}, datas={-2:0}, j=3, threads_mask=-1]
[L1041]               1  datas[j] = __VERIFIER_nondet_int()
         VAL             [__VERIFIER_nondet_int()=-5, arg={0:3}, arg={0:3}, datas={-2:0}, j=3, threads_mask=-1]
[L1051]               0  i++
         VAL             [__VERIFIER_nondet_int()=-5, arg={0:3}, arg={0:3}, datas={-2:0}, i=1, j=3, j=3, threads_mask=-1, threads_total=31, tids={8:0}]
[L1051]  COND TRUE    0  i < threads_total
[L1042]               1  threads_mask |= 1 << j
         VAL             [arg={0:3}, arg={0:3}, datas={-2:0}, j=3, threads_mask=-1, threads_mask |= 1 << j=131]
[L1052]               0  ffs(threads_mask)
         VAL             [arg={0:3}, arg={0:3}, datas={-2:0}, i=1, j=3, j=3, threads_mask=-1, threads_mask |= 1 << j=131, threads_total=31, tids={8:0}]

  - UnprovableResult [Line: 1050]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1053]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1057]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1059]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1053]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1060]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1057]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1054]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1054]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1042]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1042]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 173 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.3s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1020 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 702 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 361 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2648 IncrementalHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 361 mSolverCounterUnsat, 27 mSDtfsCounter, 2648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1887occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2023-10-27 12:24:02,640 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 974d17413865f39a607640a826612ee43ba82182a41f559c5bb885b5b3327e06
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-27 12:24:05,593 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-27 12:24:05,595 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-27 12:24:05,649 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-27 12:24:05,650 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-27 12:24:05,652 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-27 12:24:05,658 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-27 12:24:05,660 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-27 12:24:05,661 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-27 12:24:05,666 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-27 12:24:05,682 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-27 12:24:05,685 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-27 12:24:05,685 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-27 12:24:05,687 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-27 12:24:05,688 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-27 12:24:05,689 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-27 12:24:05,689 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-27 12:24:05,690 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-27 12:24:05,691 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-27 12:24:05,695 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-27 12:24:05,695 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-27 12:24:05,697 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-27 12:24:05,698 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-27 12:24:05,698 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-27 12:24:05,703 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-27 12:24:05,703 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-27 12:24:05,704 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-27 12:24:05,705 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-27 12:24:05,705 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-27 12:24:05,745 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-27 12:24:05,745 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-27 12:24:05,746 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-27 12:24:05,746 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-27 12:24:05,747 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-27 12:24:05,748 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-27 12:24:05,748 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-27 12:24:05,748 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-27 12:24:05,748 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-27 12:24:05,749 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-27 12:24:05,752 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-27 12:24:05,753 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-27 12:24:05,754 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf
[2023-10-27 12:24:05,770 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-27 12:24:05,785 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-27 12:24:05,787 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-27 12:24:05,787 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-27 12:24:05,788 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-27 12:24:05,788 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-27 12:24:05,788 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-27 12:24:05,789 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-27 12:24:05,789 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-27 12:24:05,789 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-27 12:24:05,790 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-27 12:24:05,790 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-27 12:24:05,790 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-27 12:24:05,790 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-27 12:24:05,790 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-27 12:24:05,791 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-27 12:24:05,791 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-27 12:24:05,791 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-27 12:24:05,791 INFO  L138        SettingsManager]:  * Use bitvectors instead of ints=true
[2023-10-27 12:24:05,791 INFO  L138        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2023-10-27 12:24:05,791 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-27 12:24:05,792 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-27 12:24:05,792 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-27 12:24:05,792 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-27 12:24:05,792 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-27 12:24:05,792 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-27 12:24:05,792 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-27 12:24:05,793 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:24:05,793 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-27 12:24:05,793 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-27 12:24:05,793 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-27 12:24:05,793 INFO  L138        SettingsManager]:  * Trace refinement strategy=WOLF
[2023-10-27 12:24:05,794 INFO  L138        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-10-27 12:24:05,794 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-27 12:24:05,794 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-27 12:24:05,794 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-27 12:24:05,794 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-27 12:24:05,795 INFO  L138        SettingsManager]:  * Logic for external solver=AUFBV
[2023-10-27 12:24:05,795 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-27 12:24:05,795 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 974d17413865f39a607640a826612ee43ba82182a41f559c5bb885b5b3327e06
[2023-10-27 12:24:06,255 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-27 12:24:06,294 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-27 12:24:06,296 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-27 12:24:06,303 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-27 12:24:06,303 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-27 12:24:06,305 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2023-10-27 12:24:08,150 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-27 12:24:08,562 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-27 12:24:08,563 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2023-10-27 12:24:08,602 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/a9145e59f/ed5677e58b53403c9074379fce2586ac/FLAG0da916127
[2023-10-27 12:24:08,615 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/a9145e59f/ed5677e58b53403c9074379fce2586ac
[2023-10-27 12:24:08,617 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-27 12:24:08,618 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-27 12:24:08,620 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-27 12:24:08,627 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-27 12:24:08,630 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-27 12:24:08,631 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:24:08" (1/1) ...
[2023-10-27 12:24:08,632 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4064cffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:08, skipping insertion in model container
[2023-10-27 12:24:08,633 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:24:08" (1/1) ...
[2023-10-27 12:24:08,637 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-27 12:24:08,728 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-27 12:24:08,984 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:24:09,350 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2023-10-27 12:24:09,355 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:24:09,389 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-27 12:24:09,409 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:24:09,498 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2023-10-27 12:24:09,511 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:24:09,591 INFO  L208         MainTranslator]: Completed translation
[2023-10-27 12:24:09,599 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:09 WrapperNode
[2023-10-27 12:24:09,600 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-27 12:24:09,601 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-27 12:24:09,601 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-27 12:24:09,601 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-27 12:24:09,618 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:09" (1/1) ...
[2023-10-27 12:24:09,653 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:09" (1/1) ...
[2023-10-27 12:24:09,708 INFO  L138                Inliner]: procedures = 279, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102
[2023-10-27 12:24:09,715 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-27 12:24:09,716 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-27 12:24:09,717 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-27 12:24:09,717 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-27 12:24:09,728 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:09" (1/1) ...
[2023-10-27 12:24:09,731 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:09" (1/1) ...
[2023-10-27 12:24:09,734 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:09" (1/1) ...
[2023-10-27 12:24:09,745 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:09" (1/1) ...
[2023-10-27 12:24:09,777 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:09" (1/1) ...
[2023-10-27 12:24:09,788 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:09" (1/1) ...
[2023-10-27 12:24:09,794 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:09" (1/1) ...
[2023-10-27 12:24:09,809 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:09" (1/1) ...
[2023-10-27 12:24:09,812 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-27 12:24:09,813 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-27 12:24:09,813 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-27 12:24:09,813 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-27 12:24:09,814 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:09" (1/1) ...
[2023-10-27 12:24:09,818 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:24:09,861 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:24:09,894 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-27 12:24:09,915 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-27 12:24:09,933 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4
[2023-10-27 12:24:09,934 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-27 12:24:09,935 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-27 12:24:09,935 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-27 12:24:09,935 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2023-10-27 12:24:09,940 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-27 12:24:09,941 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-27 12:24:09,941 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2023-10-27 12:24:09,941 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-27 12:24:09,941 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-27 12:24:09,941 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-27 12:24:09,941 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-27 12:24:09,945 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-27 12:24:10,217 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-27 12:24:10,223 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-27 12:24:10,742 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-27 12:24:10,749 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-27 12:24:10,751 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-27 12:24:10,752 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:24:10 BoogieIcfgContainer
[2023-10-27 12:24:10,769 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-27 12:24:10,772 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-27 12:24:10,772 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-27 12:24:10,774 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-27 12:24:10,775 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:24:08" (1/3) ...
[2023-10-27 12:24:10,775 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35bd877a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:24:10, skipping insertion in model container
[2023-10-27 12:24:10,775 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:09" (2/3) ...
[2023-10-27 12:24:10,776 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35bd877a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:24:10, skipping insertion in model container
[2023-10-27 12:24:10,777 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:24:10" (3/3) ...
[2023-10-27 12:24:10,778 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i
[2023-10-27 12:24:10,784 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-27 12:24:10,794 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-27 12:24:10,809 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2023-10-27 12:24:10,809 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-27 12:24:10,916 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-27 12:24:10,976 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 147 transitions, 302 flow
[2023-10-27 12:24:11,100 INFO  L130       PetriNetUnfolder]: 7/212 cut-off events.
[2023-10-27 12:24:11,117 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:24:11,122 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 218 conditions, 212 events. 7/212 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 410 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. 
[2023-10-27 12:24:11,122 INFO  L82        GeneralOperation]: Start removeDead. Operand has 145 places, 147 transitions, 302 flow
[2023-10-27 12:24:11,139 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 145 places, 147 transitions, 302 flow
[2023-10-27 12:24:11,142 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:24:11,156 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 147 transitions, 302 flow
[2023-10-27 12:24:11,158 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 147 transitions, 302 flow
[2023-10-27 12:24:11,173 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 147 transitions, 302 flow
[2023-10-27 12:24:11,269 INFO  L130       PetriNetUnfolder]: 7/212 cut-off events.
[2023-10-27 12:24:11,269 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:24:11,271 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 218 conditions, 212 events. 7/212 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 410 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. 
[2023-10-27 12:24:11,274 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3744
[2023-10-27 12:24:16,074 INFO  L134        LiptonReduction]: Checked pairs total: 25082
[2023-10-27 12:24:16,075 INFO  L136        LiptonReduction]: Total number of compositions: 95
[2023-10-27 12:24:16,095 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:24:16,102 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6fc67c62, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:24:16,103 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2023-10-27 12:24:16,105 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-10-27 12:24:16,106 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:24:16,106 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:16,106 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-27 12:24:16,107 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:16,112 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:16,112 INFO  L85        PathProgramCache]: Analyzing trace with hash 473, now seen corresponding path program 1 times
[2023-10-27 12:24:16,120 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-27 12:24:16,121 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102492945]
[2023-10-27 12:24:16,121 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:16,121 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:16,122 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-27 12:24:16,124 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-27 12:24:16,177 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2023-10-27 12:24:16,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:16,209 INFO  L263         TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core
[2023-10-27 12:24:16,212 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:24:16,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:24:16,215 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:24:16,215 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-27 12:24:16,221 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102492945]
[2023-10-27 12:24:16,222 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102492945] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:24:16,222 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:24:16,222 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-27 12:24:16,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847303075]
[2023-10-27 12:24:16,224 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:24:16,237 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-27 12:24:16,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-27 12:24:16,276 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-27 12:24:16,283 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-27 12:24:16,292 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 242
[2023-10-27 12:24:16,297 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 142 flow. Second operand  has 2 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:16,298 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:16,298 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 242
[2023-10-27 12:24:16,299 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:16,531 INFO  L130       PetriNetUnfolder]: 73/385 cut-off events.
[2023-10-27 12:24:16,531 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-27 12:24:16,532 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 569 conditions, 385 events. 73/385 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2075 event pairs, 72 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 499. Up to 178 conditions per place. 
[2023-10-27 12:24:16,534 INFO  L137   encePairwiseOnDemand]: 241/242 looper letters, 22 selfloop transitions, 0 changer transitions 0/66 dead transitions.
[2023-10-27 12:24:16,545 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 184 flow
[2023-10-27 12:24:16,561 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-27 12:24:16,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-27 12:24:16,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 305 transitions.
[2023-10-27 12:24:16,572 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6301652892561983
[2023-10-27 12:24:16,572 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 305 transitions.
[2023-10-27 12:24:16,573 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 305 transitions.
[2023-10-27 12:24:16,574 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:16,575 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 305 transitions.
[2023-10-27 12:24:16,580 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:16,598 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:16,599 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:16,600 INFO  L175             Difference]: Start difference. First operand has 69 places, 67 transitions, 142 flow. Second operand 2 states and 305 transitions.
[2023-10-27 12:24:16,601 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 184 flow
[2023-10-27 12:24:16,621 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:24:16,623 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 140 flow
[2023-10-27 12:24:16,625 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=140, PETRI_PLACES=69, PETRI_TRANSITIONS=66}
[2023-10-27 12:24:16,632 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places.
[2023-10-27 12:24:16,637 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 140 flow
[2023-10-27 12:24:16,638 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:16,641 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:16,642 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-27 12:24:16,662 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0
[2023-10-27 12:24:16,849 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:16,850 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:16,851 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:16,851 INFO  L85        PathProgramCache]: Analyzing trace with hash 467532, now seen corresponding path program 1 times
[2023-10-27 12:24:16,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-27 12:24:16,852 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839516470]
[2023-10-27 12:24:16,853 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:16,853 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:16,853 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-27 12:24:16,855 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-27 12:24:16,938 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2023-10-27 12:24:16,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:16,988 INFO  L263         TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-10-27 12:24:16,988 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:24:17,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:24:17,022 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:24:17,022 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-27 12:24:17,023 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839516470]
[2023-10-27 12:24:17,023 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [839516470] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:24:17,024 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:24:17,024 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:24:17,024 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466535469]
[2023-10-27 12:24:17,024 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:24:17,025 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:24:17,025 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-27 12:24:17,026 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:24:17,026 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:24:17,068 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 242
[2023-10-27 12:24:17,070 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 140 flow. Second operand  has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:17,070 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:17,071 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 242
[2023-10-27 12:24:17,071 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:17,377 INFO  L130       PetriNetUnfolder]: 119/458 cut-off events.
[2023-10-27 12:24:17,377 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-27 12:24:17,378 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 752 conditions, 458 events. 119/458 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2370 event pairs, 58 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 748. Up to 153 conditions per place. 
[2023-10-27 12:24:17,381 INFO  L137   encePairwiseOnDemand]: 231/242 looper letters, 41 selfloop transitions, 8 changer transitions 0/87 dead transitions.
[2023-10-27 12:24:17,383 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 87 transitions, 280 flow
[2023-10-27 12:24:17,383 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:24:17,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:24:17,385 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions.
[2023-10-27 12:24:17,390 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6088154269972452
[2023-10-27 12:24:17,392 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 442 transitions.
[2023-10-27 12:24:17,392 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions.
[2023-10-27 12:24:17,393 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:17,396 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions.
[2023-10-27 12:24:17,397 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:17,400 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:17,401 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:17,401 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 140 flow. Second operand 3 states and 442 transitions.
[2023-10-27 12:24:17,401 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 87 transitions, 280 flow
[2023-10-27 12:24:17,402 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 87 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:24:17,404 INFO  L231             Difference]: Finished difference. Result has 73 places, 74 transitions, 210 flow
[2023-10-27 12:24:17,404 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=73, PETRI_TRANSITIONS=74}
[2023-10-27 12:24:17,406 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 4 predicate places.
[2023-10-27 12:24:17,406 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 210 flow
[2023-10-27 12:24:17,407 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:17,407 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:17,407 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:17,424 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2023-10-27 12:24:17,615 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:17,616 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:17,616 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:17,616 INFO  L85        PathProgramCache]: Analyzing trace with hash -1212481378, now seen corresponding path program 1 times
[2023-10-27 12:24:17,617 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-27 12:24:17,618 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234453244]
[2023-10-27 12:24:17,618 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:17,618 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:17,619 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-27 12:24:17,625 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-27 12:24:17,699 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2023-10-27 12:24:17,722 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:17,724 INFO  L263         TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-10-27 12:24:17,724 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:24:17,750 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:24:17,750 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:24:17,751 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-27 12:24:17,751 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234453244]
[2023-10-27 12:24:17,755 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [234453244] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:24:17,755 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:24:17,755 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:24:17,755 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771467397]
[2023-10-27 12:24:17,755 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:24:17,756 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:24:17,756 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-27 12:24:17,757 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:24:17,757 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:24:17,800 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 131 out of 242
[2023-10-27 12:24:17,800 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 210 flow. Second operand  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:17,800 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:17,801 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 242
[2023-10-27 12:24:17,801 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:17,972 INFO  L130       PetriNetUnfolder]: 106/443 cut-off events.
[2023-10-27 12:24:17,974 INFO  L131       PetriNetUnfolder]: For 96/98 co-relation queries the response was YES.
[2023-10-27 12:24:17,977 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 853 conditions, 443 events. 106/443 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2329 event pairs, 78 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 847. Up to 229 conditions per place. 
[2023-10-27 12:24:17,978 INFO  L137   encePairwiseOnDemand]: 237/242 looper letters, 33 selfloop transitions, 6 changer transitions 0/83 dead transitions.
[2023-10-27 12:24:17,993 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 83 transitions, 316 flow
[2023-10-27 12:24:17,994 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:24:17,994 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:24:17,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions.
[2023-10-27 12:24:17,996 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5867768595041323
[2023-10-27 12:24:17,996 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 426 transitions.
[2023-10-27 12:24:17,996 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions.
[2023-10-27 12:24:17,997 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:17,997 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions.
[2023-10-27 12:24:17,998 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:18,001 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:18,002 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:18,002 INFO  L175             Difference]: Start difference. First operand has 73 places, 74 transitions, 210 flow. Second operand 3 states and 426 transitions.
[2023-10-27 12:24:18,002 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 83 transitions, 316 flow
[2023-10-27 12:24:18,008 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 83 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:24:18,009 INFO  L231             Difference]: Finished difference. Result has 74 places, 78 transitions, 236 flow
[2023-10-27 12:24:18,010 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=74, PETRI_TRANSITIONS=78}
[2023-10-27 12:24:18,011 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places.
[2023-10-27 12:24:18,011 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 236 flow
[2023-10-27 12:24:18,012 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:18,012 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:18,012 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:18,027 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2023-10-27 12:24:18,220 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:18,221 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:18,222 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:18,222 INFO  L85        PathProgramCache]: Analyzing trace with hash -1425225994, now seen corresponding path program 1 times
[2023-10-27 12:24:18,223 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-27 12:24:18,223 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061973511]
[2023-10-27 12:24:18,223 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:18,224 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:18,224 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-27 12:24:18,240 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-27 12:24:18,302 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2023-10-27 12:24:18,351 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:18,359 INFO  L263         TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core
[2023-10-27 12:24:18,361 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:24:18,428 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:24:18,445 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22
[2023-10-27 12:24:18,499 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:24:18,500 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36
[2023-10-27 12:24:18,543 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:24:18,545 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50
[2023-10-27 12:24:18,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:24:18,598 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:24:18,599 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-27 12:24:18,599 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061973511]
[2023-10-27 12:24:18,599 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061973511] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:24:18,599 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:24:18,599 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:24:18,600 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542540468]
[2023-10-27 12:24:18,600 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:24:18,600 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:24:18,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-27 12:24:18,602 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:24:18,602 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:24:19,075 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 242
[2023-10-27 12:24:19,076 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 236 flow. Second operand  has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:19,076 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:19,076 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 242
[2023-10-27 12:24:19,076 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:19,672 INFO  L130       PetriNetUnfolder]: 407/1192 cut-off events.
[2023-10-27 12:24:19,673 INFO  L131       PetriNetUnfolder]: For 254/258 co-relation queries the response was YES.
[2023-10-27 12:24:19,674 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 1192 events. 407/1192 cut-off events. For 254/258 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7853 event pairs, 134 based on Foata normal form. 0/1130 useless extension candidates. Maximal degree in co-relation 2435. Up to 530 conditions per place. 
[2023-10-27 12:24:19,679 INFO  L137   encePairwiseOnDemand]: 219/242 looper letters, 89 selfloop transitions, 29 changer transitions 0/146 dead transitions.
[2023-10-27 12:24:19,679 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 146 transitions, 641 flow
[2023-10-27 12:24:19,680 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:24:19,680 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:24:19,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 810 transitions.
[2023-10-27 12:24:19,698 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5578512396694215
[2023-10-27 12:24:19,698 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 810 transitions.
[2023-10-27 12:24:19,698 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 810 transitions.
[2023-10-27 12:24:19,699 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:19,699 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 810 transitions.
[2023-10-27 12:24:19,701 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:19,703 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:19,703 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:19,704 INFO  L175             Difference]: Start difference. First operand has 74 places, 78 transitions, 236 flow. Second operand 6 states and 810 transitions.
[2023-10-27 12:24:19,704 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 146 transitions, 641 flow
[2023-10-27 12:24:19,708 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 146 transitions, 633 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:24:19,711 INFO  L231             Difference]: Finished difference. Result has 83 places, 107 transitions, 450 flow
[2023-10-27 12:24:19,712 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=450, PETRI_PLACES=83, PETRI_TRANSITIONS=107}
[2023-10-27 12:24:19,714 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 14 predicate places.
[2023-10-27 12:24:19,714 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 107 transitions, 450 flow
[2023-10-27 12:24:19,715 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:19,715 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:19,715 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:19,732 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0
[2023-10-27 12:24:19,925 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:19,925 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:19,926 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:19,926 INFO  L85        PathProgramCache]: Analyzing trace with hash 452500327, now seen corresponding path program 1 times
[2023-10-27 12:24:19,927 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-27 12:24:19,927 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999414461]
[2023-10-27 12:24:19,927 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:19,927 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:19,927 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-27 12:24:19,946 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-27 12:24:19,976 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2023-10-27 12:24:20,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:20,044 INFO  L263         TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-10-27 12:24:20,044 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:24:20,058 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:24:20,058 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:24:20,059 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-27 12:24:20,061 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999414461]
[2023-10-27 12:24:20,061 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999414461] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:24:20,061 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:24:20,061 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:24:20,062 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374994833]
[2023-10-27 12:24:20,063 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:24:20,063 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:24:20,063 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-27 12:24:20,064 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:24:20,064 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:24:20,086 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 242
[2023-10-27 12:24:20,086 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 107 transitions, 450 flow. Second operand  has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:20,086 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:20,087 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 242
[2023-10-27 12:24:20,087 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:20,301 INFO  L130       PetriNetUnfolder]: 215/860 cut-off events.
[2023-10-27 12:24:20,301 INFO  L131       PetriNetUnfolder]: For 277/293 co-relation queries the response was YES.
[2023-10-27 12:24:20,303 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 860 events. 215/860 cut-off events. For 277/293 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5647 event pairs, 32 based on Foata normal form. 19/843 useless extension candidates. Maximal degree in co-relation 1989. Up to 338 conditions per place. 
[2023-10-27 12:24:20,305 INFO  L137   encePairwiseOnDemand]: 238/242 looper letters, 44 selfloop transitions, 2 changer transitions 0/118 dead transitions.
[2023-10-27 12:24:20,305 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 118 transitions, 578 flow
[2023-10-27 12:24:20,306 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:24:20,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:24:20,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions.
[2023-10-27 12:24:20,314 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6074380165289256
[2023-10-27 12:24:20,315 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 441 transitions.
[2023-10-27 12:24:20,315 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions.
[2023-10-27 12:24:20,315 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:20,315 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions.
[2023-10-27 12:24:20,316 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:20,317 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:20,318 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:20,318 INFO  L175             Difference]: Start difference. First operand has 83 places, 107 transitions, 450 flow. Second operand 3 states and 441 transitions.
[2023-10-27 12:24:20,318 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 118 transitions, 578 flow
[2023-10-27 12:24:20,321 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 118 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:24:20,323 INFO  L231             Difference]: Finished difference. Result has 84 places, 107 transitions, 460 flow
[2023-10-27 12:24:20,323 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=84, PETRI_TRANSITIONS=107}
[2023-10-27 12:24:20,329 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 15 predicate places.
[2023-10-27 12:24:20,329 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 107 transitions, 460 flow
[2023-10-27 12:24:20,329 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:20,329 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:20,330 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:20,352 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0
[2023-10-27 12:24:20,537 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:20,538 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:20,538 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:20,538 INFO  L85        PathProgramCache]: Analyzing trace with hash -1792765839, now seen corresponding path program 1 times
[2023-10-27 12:24:20,539 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-27 12:24:20,539 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106242150]
[2023-10-27 12:24:20,539 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:20,539 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:20,540 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-27 12:24:20,548 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-27 12:24:20,608 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2023-10-27 12:24:20,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:20,650 INFO  L263         TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core
[2023-10-27 12:24:20,653 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:24:20,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:24:20,740 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:24:20,740 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-27 12:24:20,740 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106242150]
[2023-10-27 12:24:20,741 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106242150] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:24:20,741 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:24:20,741 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-27 12:24:20,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442770453]
[2023-10-27 12:24:20,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:24:20,741 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-27 12:24:20,742 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-27 12:24:20,742 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-27 12:24:20,743 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-27 12:24:20,883 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 242
[2023-10-27 12:24:20,884 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 107 transitions, 460 flow. Second operand  has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:20,884 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:20,884 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 242
[2023-10-27 12:24:20,884 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:21,153 INFO  L130       PetriNetUnfolder]: 193/868 cut-off events.
[2023-10-27 12:24:21,153 INFO  L131       PetriNetUnfolder]: For 297/307 co-relation queries the response was YES.
[2023-10-27 12:24:21,155 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 868 events. 193/868 cut-off events. For 297/307 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6181 event pairs, 18 based on Foata normal form. 2/832 useless extension candidates. Maximal degree in co-relation 2026. Up to 292 conditions per place. 
[2023-10-27 12:24:21,157 INFO  L137   encePairwiseOnDemand]: 238/242 looper letters, 42 selfloop transitions, 2 changer transitions 4/123 dead transitions.
[2023-10-27 12:24:21,162 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 123 transitions, 613 flow
[2023-10-27 12:24:21,163 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-27 12:24:21,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-27 12:24:21,164 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions.
[2023-10-27 12:24:21,165 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5981404958677686
[2023-10-27 12:24:21,165 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 579 transitions.
[2023-10-27 12:24:21,165 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions.
[2023-10-27 12:24:21,165 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:21,166 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions.
[2023-10-27 12:24:21,167 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:21,183 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:21,183 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:21,184 INFO  L175             Difference]: Start difference. First operand has 84 places, 107 transitions, 460 flow. Second operand 4 states and 579 transitions.
[2023-10-27 12:24:21,184 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 123 transitions, 613 flow
[2023-10-27 12:24:21,188 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 123 transitions, 613 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:24:21,189 INFO  L231             Difference]: Finished difference. Result has 89 places, 107 transitions, 470 flow
[2023-10-27 12:24:21,190 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=470, PETRI_PLACES=89, PETRI_TRANSITIONS=107}
[2023-10-27 12:24:21,192 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 20 predicate places.
[2023-10-27 12:24:21,192 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 107 transitions, 470 flow
[2023-10-27 12:24:21,193 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:21,194 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:21,194 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:21,215 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0
[2023-10-27 12:24:21,401 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:21,402 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:21,402 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:21,402 INFO  L85        PathProgramCache]: Analyzing trace with hash -680468640, now seen corresponding path program 1 times
[2023-10-27 12:24:21,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-27 12:24:21,403 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653468554]
[2023-10-27 12:24:21,403 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:21,403 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:21,404 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-27 12:24:21,414 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-27 12:24:21,464 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2023-10-27 12:24:21,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:21,556 INFO  L263         TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core
[2023-10-27 12:24:21,559 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:24:21,569 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13
[2023-10-27 12:24:21,585 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33
[2023-10-27 12:24:21,645 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:24:21,645 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52
[2023-10-27 12:24:21,705 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:24:21,706 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71
[2023-10-27 12:24:21,778 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:24:21,778 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:24:21,779 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-27 12:24:21,779 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653468554]
[2023-10-27 12:24:21,779 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [653468554] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:24:21,779 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:24:21,779 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:24:21,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275628518]
[2023-10-27 12:24:21,779 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:24:21,780 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:24:21,780 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-27 12:24:21,780 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:24:21,780 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:24:22,268 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242
[2023-10-27 12:24:22,269 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 107 transitions, 470 flow. Second operand  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:22,269 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:22,269 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242
[2023-10-27 12:24:22,269 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:23,551 INFO  L130       PetriNetUnfolder]: 565/1517 cut-off events.
[2023-10-27 12:24:23,551 INFO  L131       PetriNetUnfolder]: For 805/820 co-relation queries the response was YES.
[2023-10-27 12:24:23,553 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4225 conditions, 1517 events. 565/1517 cut-off events. For 805/820 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 10258 event pairs, 170 based on Foata normal form. 2/1445 useless extension candidates. Maximal degree in co-relation 4210. Up to 966 conditions per place. 
[2023-10-27 12:24:23,575 INFO  L137   encePairwiseOnDemand]: 219/242 looper letters, 127 selfloop transitions, 85 changer transitions 0/241 dead transitions.
[2023-10-27 12:24:23,575 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 241 transitions, 1458 flow
[2023-10-27 12:24:23,576 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:24:23,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:24:23,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions.
[2023-10-27 12:24:23,578 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5819559228650137
[2023-10-27 12:24:23,578 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 845 transitions.
[2023-10-27 12:24:23,578 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 845 transitions.
[2023-10-27 12:24:23,579 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:23,579 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 845 transitions.
[2023-10-27 12:24:23,580 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:23,583 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:23,583 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:23,583 INFO  L175             Difference]: Start difference. First operand has 89 places, 107 transitions, 470 flow. Second operand 6 states and 845 transitions.
[2023-10-27 12:24:23,583 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 241 transitions, 1458 flow
[2023-10-27 12:24:23,594 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 241 transitions, 1436 flow, removed 5 selfloop flow, removed 3 redundant places.
[2023-10-27 12:24:23,614 INFO  L231             Difference]: Finished difference. Result has 95 places, 188 transitions, 1212 flow
[2023-10-27 12:24:23,614 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1212, PETRI_PLACES=95, PETRI_TRANSITIONS=188}
[2023-10-27 12:24:23,615 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places.
[2023-10-27 12:24:23,615 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 188 transitions, 1212 flow
[2023-10-27 12:24:23,615 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:23,615 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:23,615 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:23,626 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0
[2023-10-27 12:24:23,823 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:23,824 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:23,824 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:23,824 INFO  L85        PathProgramCache]: Analyzing trace with hash -1641426374, now seen corresponding path program 1 times
[2023-10-27 12:24:23,825 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-27 12:24:23,825 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817985002]
[2023-10-27 12:24:23,825 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:23,825 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:23,825 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-27 12:24:23,830 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-27 12:24:23,884 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2023-10-27 12:24:23,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:23,958 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core
[2023-10-27 12:24:23,960 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:24:24,227 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:24:24,228 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:24:24,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:24:24,497 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-27 12:24:24,497 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817985002]
[2023-10-27 12:24:24,497 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817985002] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:24:24,497 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-10-27 12:24:24,497 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9
[2023-10-27 12:24:24,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081705050]
[2023-10-27 12:24:24,497 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:24:24,498 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-27 12:24:24,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-27 12:24:24,498 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-27 12:24:24,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2023-10-27 12:24:25,095 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 131 out of 242
[2023-10-27 12:24:25,096 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 188 transitions, 1212 flow. Second operand  has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:25,096 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:25,096 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 242
[2023-10-27 12:24:25,096 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:25,564 INFO  L130       PetriNetUnfolder]: 271/947 cut-off events.
[2023-10-27 12:24:25,564 INFO  L131       PetriNetUnfolder]: For 907/937 co-relation queries the response was YES.
[2023-10-27 12:24:25,565 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2844 conditions, 947 events. 271/947 cut-off events. For 907/937 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6320 event pairs, 52 based on Foata normal form. 4/924 useless extension candidates. Maximal degree in co-relation 2826. Up to 234 conditions per place. 
[2023-10-27 12:24:25,568 INFO  L137   encePairwiseOnDemand]: 235/242 looper letters, 43 selfloop transitions, 6 changer transitions 12/184 dead transitions.
[2023-10-27 12:24:25,581 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 184 transitions, 1209 flow
[2023-10-27 12:24:25,582 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-27 12:24:25,582 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-27 12:24:25,584 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 959 transitions.
[2023-10-27 12:24:25,584 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5661157024793388
[2023-10-27 12:24:25,584 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 959 transitions.
[2023-10-27 12:24:25,585 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 959 transitions.
[2023-10-27 12:24:25,585 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:25,585 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 959 transitions.
[2023-10-27 12:24:25,588 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:25,590 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:25,592 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:25,592 INFO  L175             Difference]: Start difference. First operand has 95 places, 188 transitions, 1212 flow. Second operand 7 states and 959 transitions.
[2023-10-27 12:24:25,592 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 184 transitions, 1209 flow
[2023-10-27 12:24:25,607 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 184 transitions, 1149 flow, removed 27 selfloop flow, removed 2 redundant places.
[2023-10-27 12:24:25,611 INFO  L231             Difference]: Finished difference. Result has 100 places, 153 transitions, 935 flow
[2023-10-27 12:24:25,611 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=935, PETRI_PLACES=100, PETRI_TRANSITIONS=153}
[2023-10-27 12:24:25,627 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 31 predicate places.
[2023-10-27 12:24:25,627 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 153 transitions, 935 flow
[2023-10-27 12:24:25,627 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:25,627 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:25,628 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:25,640 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0
[2023-10-27 12:24:25,836 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:25,836 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:25,837 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:25,838 INFO  L85        PathProgramCache]: Analyzing trace with hash 1826499191, now seen corresponding path program 1 times
[2023-10-27 12:24:25,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-27 12:24:25,839 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497182221]
[2023-10-27 12:24:25,839 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:25,839 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:25,839 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-27 12:24:25,842 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-27 12:24:25,902 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process
[2023-10-27 12:24:25,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:25,987 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core
[2023-10-27 12:24:25,989 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:24:26,243 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:24:26,262 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22
[2023-10-27 12:24:26,335 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:24:26,335 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36
[2023-10-27 12:24:26,403 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:24:26,403 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50
[2023-10-27 12:24:26,510 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:24:26,511 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:24:26,609 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:24:26,609 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:24:26,610 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-27 12:24:26,610 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497182221]
[2023-10-27 12:24:26,610 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [497182221] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:24:26,610 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:24:26,610 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-27 12:24:26,610 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63049794]
[2023-10-27 12:24:26,610 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:24:26,610 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-27 12:24:26,610 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-27 12:24:26,611 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-27 12:24:26,611 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-27 12:24:29,431 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242
[2023-10-27 12:24:29,433 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 153 transitions, 935 flow. Second operand  has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:29,433 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:29,433 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242
[2023-10-27 12:24:29,433 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:30,604 INFO  L130       PetriNetUnfolder]: 384/1088 cut-off events.
[2023-10-27 12:24:30,604 INFO  L131       PetriNetUnfolder]: For 1083/1091 co-relation queries the response was YES.
[2023-10-27 12:24:30,606 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 1088 events. 384/1088 cut-off events. For 1083/1091 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6878 event pairs, 168 based on Foata normal form. 26/1085 useless extension candidates. Maximal degree in co-relation 3719. Up to 792 conditions per place. 
[2023-10-27 12:24:30,610 INFO  L137   encePairwiseOnDemand]: 235/242 looper letters, 114 selfloop transitions, 5 changer transitions 0/160 dead transitions.
[2023-10-27 12:24:30,610 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 160 transitions, 1217 flow
[2023-10-27 12:24:30,610 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-27 12:24:30,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-27 12:24:30,612 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions.
[2023-10-27 12:24:30,613 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.49763872491145217
[2023-10-27 12:24:30,613 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 843 transitions.
[2023-10-27 12:24:30,613 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions.
[2023-10-27 12:24:30,613 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:30,614 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions.
[2023-10-27 12:24:30,615 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:30,617 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:30,617 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:30,617 INFO  L175             Difference]: Start difference. First operand has 100 places, 153 transitions, 935 flow. Second operand 7 states and 843 transitions.
[2023-10-27 12:24:30,618 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 160 transitions, 1217 flow
[2023-10-27 12:24:30,624 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 160 transitions, 1194 flow, removed 1 selfloop flow, removed 5 redundant places.
[2023-10-27 12:24:30,630 INFO  L231             Difference]: Finished difference. Result has 95 places, 155 transitions, 962 flow
[2023-10-27 12:24:30,630 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=962, PETRI_PLACES=95, PETRI_TRANSITIONS=155}
[2023-10-27 12:24:30,631 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places.
[2023-10-27 12:24:30,631 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 155 transitions, 962 flow
[2023-10-27 12:24:30,632 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:30,632 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:30,632 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:30,655 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0
[2023-10-27 12:24:30,853 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:30,853 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:30,854 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:30,854 INFO  L85        PathProgramCache]: Analyzing trace with hash 1814981271, now seen corresponding path program 1 times
[2023-10-27 12:24:30,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-27 12:24:30,854 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681105014]
[2023-10-27 12:24:30,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:30,854 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:30,854 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-27 12:24:30,870 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-27 12:24:30,915 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process
[2023-10-27 12:24:31,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:31,052 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core
[2023-10-27 12:24:31,059 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:24:31,234 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13
[2023-10-27 12:24:31,312 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33
[2023-10-27 12:24:31,377 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:24:31,378 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52
[2023-10-27 12:24:31,498 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:24:31,498 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71
[2023-10-27 12:24:31,626 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:24:31,627 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58
[2023-10-27 12:24:31,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:24:31,765 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:24:31,765 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-27 12:24:31,765 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681105014]
[2023-10-27 12:24:31,765 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [681105014] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:24:31,766 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:24:31,766 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-27 12:24:31,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199902565]
[2023-10-27 12:24:31,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:24:31,766 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-27 12:24:31,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-27 12:24:31,766 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-27 12:24:31,766 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-27 12:24:33,101 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242
[2023-10-27 12:24:33,102 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 155 transitions, 962 flow. Second operand  has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:33,102 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:33,102 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242
[2023-10-27 12:24:33,102 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:36,113 INFO  L130       PetriNetUnfolder]: 403/1095 cut-off events.
[2023-10-27 12:24:36,113 INFO  L131       PetriNetUnfolder]: For 1014/1023 co-relation queries the response was YES.
[2023-10-27 12:24:36,115 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3775 conditions, 1095 events. 403/1095 cut-off events. For 1014/1023 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6778 event pairs, 132 based on Foata normal form. 20/1082 useless extension candidates. Maximal degree in co-relation 3753. Up to 521 conditions per place. 
[2023-10-27 12:24:36,120 INFO  L137   encePairwiseOnDemand]: 230/242 looper letters, 177 selfloop transitions, 48 changer transitions 0/249 dead transitions.
[2023-10-27 12:24:36,120 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 249 transitions, 1973 flow
[2023-10-27 12:24:36,120 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-27 12:24:36,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-27 12:24:36,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions.
[2023-10-27 12:24:36,123 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5330578512396694
[2023-10-27 12:24:36,123 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 903 transitions.
[2023-10-27 12:24:36,123 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions.
[2023-10-27 12:24:36,123 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:36,124 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions.
[2023-10-27 12:24:36,131 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:36,134 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:36,135 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:36,135 INFO  L175             Difference]: Start difference. First operand has 95 places, 155 transitions, 962 flow. Second operand 7 states and 903 transitions.
[2023-10-27 12:24:36,135 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 249 transitions, 1973 flow
[2023-10-27 12:24:36,142 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 249 transitions, 1964 flow, removed 4 selfloop flow, removed 1 redundant places.
[2023-10-27 12:24:36,160 INFO  L231             Difference]: Finished difference. Result has 105 places, 167 transitions, 1233 flow
[2023-10-27 12:24:36,161 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1233, PETRI_PLACES=105, PETRI_TRANSITIONS=167}
[2023-10-27 12:24:36,161 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 36 predicate places.
[2023-10-27 12:24:36,161 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 167 transitions, 1233 flow
[2023-10-27 12:24:36,162 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:36,162 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:36,162 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:36,173 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0
[2023-10-27 12:24:36,370 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:36,371 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:36,371 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:36,371 INFO  L85        PathProgramCache]: Analyzing trace with hash -86355948, now seen corresponding path program 1 times
[2023-10-27 12:24:36,372 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-27 12:24:36,372 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048001455]
[2023-10-27 12:24:36,372 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:36,372 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:36,373 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-27 12:24:36,378 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-27 12:24:36,434 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process
[2023-10-27 12:24:36,496 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:36,498 INFO  L263         TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-10-27 12:24:36,499 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:24:36,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:24:36,504 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:24:36,504 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-27 12:24:36,505 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048001455]
[2023-10-27 12:24:36,505 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048001455] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:24:36,505 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:24:36,505 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:24:36,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821492362]
[2023-10-27 12:24:36,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:24:36,506 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:24:36,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-27 12:24:36,506 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:24:36,506 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:24:36,537 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 242
[2023-10-27 12:24:36,538 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 167 transitions, 1233 flow. Second operand  has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:36,538 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:36,539 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 242
[2023-10-27 12:24:36,539 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:36,745 INFO  L130       PetriNetUnfolder]: 280/891 cut-off events.
[2023-10-27 12:24:36,745 INFO  L131       PetriNetUnfolder]: For 1922/1959 co-relation queries the response was YES.
[2023-10-27 12:24:36,762 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3244 conditions, 891 events. 280/891 cut-off events. For 1922/1959 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5705 event pairs, 69 based on Foata normal form. 11/867 useless extension candidates. Maximal degree in co-relation 3217. Up to 294 conditions per place. 
[2023-10-27 12:24:36,765 INFO  L137   encePairwiseOnDemand]: 236/242 looper letters, 39 selfloop transitions, 10 changer transitions 0/179 dead transitions.
[2023-10-27 12:24:36,766 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 179 transitions, 1381 flow
[2023-10-27 12:24:36,766 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:24:36,766 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:24:36,767 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions.
[2023-10-27 12:24:36,767 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5895316804407713
[2023-10-27 12:24:36,767 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 428 transitions.
[2023-10-27 12:24:36,767 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions.
[2023-10-27 12:24:36,768 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:36,768 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions.
[2023-10-27 12:24:36,769 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:36,770 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:36,770 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:36,770 INFO  L175             Difference]: Start difference. First operand has 105 places, 167 transitions, 1233 flow. Second operand 3 states and 428 transitions.
[2023-10-27 12:24:36,770 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 179 transitions, 1381 flow
[2023-10-27 12:24:36,778 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 179 transitions, 1368 flow, removed 6 selfloop flow, removed 1 redundant places.
[2023-10-27 12:24:36,798 INFO  L231             Difference]: Finished difference. Result has 107 places, 173 transitions, 1292 flow
[2023-10-27 12:24:36,798 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1292, PETRI_PLACES=107, PETRI_TRANSITIONS=173}
[2023-10-27 12:24:36,799 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 38 predicate places.
[2023-10-27 12:24:36,799 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 173 transitions, 1292 flow
[2023-10-27 12:24:36,799 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:36,799 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:36,799 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:36,815 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0
[2023-10-27 12:24:37,007 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:37,008 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:37,008 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:37,008 INFO  L85        PathProgramCache]: Analyzing trace with hash -1426846396, now seen corresponding path program 1 times
[2023-10-27 12:24:37,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-27 12:24:37,009 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86765362]
[2023-10-27 12:24:37,009 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:37,010 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:37,010 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-27 12:24:37,026 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-27 12:24:37,069 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process
[2023-10-27 12:24:37,158 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:37,173 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core
[2023-10-27 12:24:37,179 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:24:37,183 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:24:37,195 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29
[2023-10-27 12:24:37,228 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:24:37,228 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46
[2023-10-27 12:24:37,301 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:24:37,301 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 63
[2023-10-27 12:24:37,370 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:24:37,370 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:24:37,370 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-27 12:24:37,370 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86765362]
[2023-10-27 12:24:37,370 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [86765362] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:24:37,370 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:24:37,370 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:24:37,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645737877]
[2023-10-27 12:24:37,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:24:37,370 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:24:37,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-27 12:24:37,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:24:37,371 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:24:37,986 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 242
[2023-10-27 12:24:37,986 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 173 transitions, 1292 flow. Second operand  has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:37,986 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:37,986 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 242
[2023-10-27 12:24:37,987 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:38,731 INFO  L130       PetriNetUnfolder]: 411/1111 cut-off events.
[2023-10-27 12:24:38,732 INFO  L131       PetriNetUnfolder]: For 2953/3001 co-relation queries the response was YES.
[2023-10-27 12:24:38,734 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4544 conditions, 1111 events. 411/1111 cut-off events. For 2953/3001 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6802 event pairs, 104 based on Foata normal form. 12/1098 useless extension candidates. Maximal degree in co-relation 4516. Up to 586 conditions per place. 
[2023-10-27 12:24:38,738 INFO  L137   encePairwiseOnDemand]: 231/242 looper letters, 85 selfloop transitions, 41 changer transitions 36/239 dead transitions.
[2023-10-27 12:24:38,738 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 239 transitions, 2072 flow
[2023-10-27 12:24:38,742 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:24:38,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:24:38,744 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 832 transitions.
[2023-10-27 12:24:38,744 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5730027548209367
[2023-10-27 12:24:38,744 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 832 transitions.
[2023-10-27 12:24:38,744 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 832 transitions.
[2023-10-27 12:24:38,745 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:38,745 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 832 transitions.
[2023-10-27 12:24:38,746 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:38,748 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:38,748 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:38,749 INFO  L175             Difference]: Start difference. First operand has 107 places, 173 transitions, 1292 flow. Second operand 6 states and 832 transitions.
[2023-10-27 12:24:38,749 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 239 transitions, 2072 flow
[2023-10-27 12:24:38,775 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 239 transitions, 2056 flow, removed 1 selfloop flow, removed 1 redundant places.
[2023-10-27 12:24:38,778 INFO  L231             Difference]: Finished difference. Result has 116 places, 195 transitions, 1624 flow
[2023-10-27 12:24:38,792 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1624, PETRI_PLACES=116, PETRI_TRANSITIONS=195}
[2023-10-27 12:24:38,793 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 47 predicate places.
[2023-10-27 12:24:38,793 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 195 transitions, 1624 flow
[2023-10-27 12:24:38,793 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:38,793 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:38,793 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:38,804 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0
[2023-10-27 12:24:39,001 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:39,002 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:24:39,002 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:39,002 INFO  L85        PathProgramCache]: Analyzing trace with hash -1114213243, now seen corresponding path program 1 times
[2023-10-27 12:24:39,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-27 12:24:39,003 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310122511]
[2023-10-27 12:24:39,003 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:39,003 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:39,004 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-27 12:24:39,022 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-27 12:24:39,077 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process
[2023-10-27 12:24:39,169 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:24:39,169 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-27 12:24:39,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:24:39,299 INFO  L130   FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2023-10-27 12:24:39,299 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-27 12:24:39,300 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining)
[2023-10-27 12:24:39,308 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2023-10-27 12:24:39,308 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2023-10-27 12:24:39,309 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2023-10-27 12:24:39,309 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2023-10-27 12:24:39,309 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2023-10-27 12:24:39,309 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2023-10-27 12:24:39,309 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2023-10-27 12:24:39,309 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2023-10-27 12:24:39,309 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining)
[2023-10-27 12:24:39,310 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2023-10-27 12:24:39,310 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2023-10-27 12:24:39,310 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2023-10-27 12:24:39,310 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2023-10-27 12:24:39,310 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2023-10-27 12:24:39,310 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2023-10-27 12:24:39,310 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2023-10-27 12:24:39,311 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2023-10-27 12:24:39,359 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0
[2023-10-27 12:24:39,511 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-27 12:24:39,511 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:39,516 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-10-27 12:24:39,516 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-10-27 12:24:39,596 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:24:39 BasicIcfg
[2023-10-27 12:24:39,596 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-10-27 12:24:39,596 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-10-27 12:24:39,596 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-10-27 12:24:39,597 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-10-27 12:24:39,597 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:24:10" (3/4) ...
[2023-10-27 12:24:39,601 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-10-27 12:24:39,607 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-10-27 12:24:39,608 INFO  L158              Benchmark]: Toolchain (without parser) took 30990.00ms. Allocated memory was 39.8MB in the beginning and 73.2MB in the end (delta: 33.4MB). Free memory was 17.2MB in the beginning and 22.7MB in the end (delta: -5.4MB). Peak memory consumption was 28.0MB. Max. memory is 15.6GB.
[2023-10-27 12:24:39,608 INFO  L158              Benchmark]: CDTParser took 0.15ms. Allocated memory is still 31.6MB. Free memory was 11.3MB in the beginning and 11.2MB in the end (delta: 60.5kB). Peak memory consumption was 60.5kB. Max. memory is 15.6GB.
[2023-10-27 12:24:39,609 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 979.97ms. Allocated memory is still 39.8MB. Free memory was 17.0MB in the beginning and 15.5MB in the end (delta: 1.5MB). Peak memory consumption was 10.2MB. Max. memory is 15.6GB.
[2023-10-27 12:24:39,609 INFO  L158              Benchmark]: Boogie Procedure Inliner took 114.51ms. Allocated memory is still 39.8MB. Free memory was 15.3MB in the beginning and 12.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.7MB. Max. memory is 15.6GB.
[2023-10-27 12:24:39,610 INFO  L158              Benchmark]: Boogie Preprocessor took 95.97ms. Allocated memory is still 39.8MB. Free memory was 12.6MB in the beginning and 10.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.6MB. Max. memory is 15.6GB.
[2023-10-27 12:24:39,610 INFO  L158              Benchmark]: RCFGBuilder took 956.48ms. Allocated memory is still 39.8MB. Free memory was 10.1MB in the beginning and 9.1MB in the end (delta: 998.5kB). Peak memory consumption was 5.6MB. Max. memory is 15.6GB.
[2023-10-27 12:24:39,610 INFO  L158              Benchmark]: TraceAbstraction took 28824.41ms. Allocated memory was 39.8MB in the beginning and 73.2MB in the end (delta: 33.4MB). Free memory was 8.2MB in the beginning and 23.1MB in the end (delta: -14.9MB). Peak memory consumption was 18.6MB. Max. memory is 15.6GB.
[2023-10-27 12:24:39,610 INFO  L158              Benchmark]: Witness Printer took 11.24ms. Allocated memory is still 73.2MB. Free memory was 23.1MB in the beginning and 22.7MB in the end (delta: 405.7kB). Peak memory consumption was 405.7kB. Max. memory is 15.6GB.
[2023-10-27 12:24:39,615 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.15ms. Allocated memory is still 31.6MB. Free memory was 11.3MB in the beginning and 11.2MB in the end (delta: 60.5kB). Peak memory consumption was 60.5kB. Max. memory is 15.6GB.
 * CACSL2BoogieTranslator took 979.97ms. Allocated memory is still 39.8MB. Free memory was 17.0MB in the beginning and 15.5MB in the end (delta: 1.5MB). Peak memory consumption was 10.2MB. Max. memory is 15.6GB.
 * Boogie Procedure Inliner took 114.51ms. Allocated memory is still 39.8MB. Free memory was 15.3MB in the beginning and 12.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.7MB. Max. memory is 15.6GB.
 * Boogie Preprocessor took 95.97ms. Allocated memory is still 39.8MB. Free memory was 12.6MB in the beginning and 10.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.6MB. Max. memory is 15.6GB.
 * RCFGBuilder took 956.48ms. Allocated memory is still 39.8MB. Free memory was 10.1MB in the beginning and 9.1MB in the end (delta: 998.5kB). Peak memory consumption was 5.6MB. Max. memory is 15.6GB.
 * TraceAbstraction took 28824.41ms. Allocated memory was 39.8MB in the beginning and 73.2MB in the end (delta: 33.4MB). Free memory was 8.2MB in the beginning and 23.1MB in the end (delta: -14.9MB). Peak memory consumption was 18.6MB. Max. memory is 15.6GB.
 * Witness Printer took 11.24ms. Allocated memory is still 73.2MB. Free memory was 23.1MB in the beginning and 22.7MB in the end (delta: 405.7kB). Peak memory consumption was 405.7kB. Max. memory is 15.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 4.9s, 145 PlacesBefore, 69 PlacesAfterwards, 147 TransitionsBefore, 67 TransitionsAfterwards, 3744 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 95 TotalNumberOfCompositions, 25082 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6302, independent: 5432, independent conditional: 0, independent unconditional: 5432, dependent: 870, dependent conditional: 0, dependent unconditional: 870, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1627, independent: 1546, independent conditional: 0, independent unconditional: 1546, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6302, independent: 3886, independent conditional: 0, independent unconditional: 3886, dependent: 789, dependent conditional: 0, dependent unconditional: 789, unknown: 1627, unknown conditional: 0, unknown unconditional: 1627] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 340, Positive conditional cache size: 0, Positive unconditional cache size: 340, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - DataRaceFoundResult [Line: 1052]: Data race detected
    Data race detected
The following path leads to a data race: 
[L1037]               0  int threads_mask = -1;
[L1038]               0  int *datas;
[L1046]               0  int threads_total = __VERIFIER_nondet_int();
[L1047]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L1034]  COND FALSE   0  !(!cond)
[L1047]  RET          0  assume_abort_if_not(threads_total >= 0)
[L1048]  CALL         0  assume_abort_if_not(threads_total < 32)
[L1034]  COND FALSE   0  !(!cond)
[L1048]  RET          0  assume_abort_if_not(threads_total < 32)
[L1049]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1049]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1050]               0  datas = malloc(threads_total * sizeof(int))
[L1051]               0  int i = 0;
         VAL             [datas={1:0}, i=0, threads_mask=-1, threads_total=3, tids={7:0}]
[L1051]  COND TRUE    0  i < threads_total
[L1052]  EXPR         0  ffs(threads_mask)
[L1052]               0  int j = ffs(threads_mask) - 1;
[L1053]               0  threads_mask &= ~(1 << j)
[L1054]  EXPR         0  \read(*tids)
         VAL             [\read(*tids)={5:0}, datas={1:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, j)=0, threads_mask=-2, threads_total=3, tids={7:0}]
[L1054]  EXPR         0  tids[i]
         VAL             [\read(*tids)={5:0}, datas={1:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, j)=0, threads_mask=-2, threads_total=3, tids={7:0}]
[L1054]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, j)
         VAL             [\read(*tids)={5:0}, arg={0:0}, datas={1:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, j)=0, threads_mask=-2, threads_total=3, tids={7:0}]
[L1051]               0  i++
         VAL             [arg={0:0}, datas={1:0}, i=1, j=0, threads_mask=-2, threads_total=3, tids={7:0}]
[L1040]               1  int j = arg;
[L1041]  EXPR         1  datas[j]
         VAL             [arg={0:0}, arg={0:0}, datas={1:0}, j=0, threads_mask=-2]
[L1041]               1  datas[j] = __VERIFIER_nondet_int()
         VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, datas={1:0}, j=0, threads_mask=-2]
[L1051]  COND TRUE    0  i < threads_total
[L1041]               1  datas[j] = __VERIFIER_nondet_int()
[L1042]               1  threads_mask |= 1 << j
         VAL             [arg={0:0}, arg={0:0}, datas={1:0}, j=0, threads_mask=-1, threads_mask |= 1 << j=-1]
[L1052]               0  ffs(threads_mask)
         VAL             [arg={0:0}, arg={0:0}, datas={1:0}, i=1, j=0, j=0, threads_mask=-1, threads_mask |= 1 << j=-1, threads_total=3, tids={7:0}]

Now there is a data race on ~threads_mask~0 between 
	C: threads_mask |= 1 << j [1042]
and
	C: ffs(threads_mask) [1052]

  - UnprovableResult [Line: 1050]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1053]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1057]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1059]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1053]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1060]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1057]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1054]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1054]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1042]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1042]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 170 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.5s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1300 SdHoareTripleChecker+Valid, 13.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 944 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 11.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 365 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3001 IncrementalHoareTripleChecker+Invalid, 3366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 365 mSolverCounterUnsat, 23 mSDtfsCounter, 3001 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1624occurred in iteration=12, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 226 ConstructedInterpolants, 54 QuantifiedInterpolants, 1643 SizeOfPredicates, 14 NumberOfNonLiveVariables, 919 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 3/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2023-10-27 12:24:39,705 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
