./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/14_spin2003.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/14_spin2003.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --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 83bca07672f78100877a79a1440d2a8107bad3ebb200d176bee629abfa2ef706 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:30:17,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:30:17,397 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 03:30:17,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:30:17,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:30:17,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:30:17,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:30:17,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:30:17,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:30:17,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:30:17,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:30:17,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:30:17,450 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:30:17,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:30:17,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:30:17,452 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:30:17,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:30:17,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:30:17,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:30:17,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:30:17,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:30:17,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:30:17,452 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 03:30:17,452 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:30:17,452 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:30:17,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:30:17,453 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:30:17,453 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:30:17,454 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:30:17,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:30:17,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:30:17,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:30:17,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:30:17,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:30:17,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:30:17,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:30:17,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:30:17,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:30:17,456 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:30:17,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:30:17,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:30:17,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:30:17,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:30:17,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:30:17,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:30:17,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:30:17,458 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 83bca07672f78100877a79a1440d2a8107bad3ebb200d176bee629abfa2ef706 [2024-11-28 03:30:17,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:30:17,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:30:17,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:30:17,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:30:17,850 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:30:17,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-ext/14_spin2003.i [2024-11-28 03:30:21,154 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/bin/uautomizer-verify-aQ6SnzHsRB/data/5b1f4db49/dfad87d2ba554ee5a994c5699b4bef3d/FLAG592ee3b22 [2024-11-28 03:30:21,543 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:30:21,544 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/sv-benchmarks/c/pthread-ext/14_spin2003.i [2024-11-28 03:30:21,561 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/bin/uautomizer-verify-aQ6SnzHsRB/data/5b1f4db49/dfad87d2ba554ee5a994c5699b4bef3d/FLAG592ee3b22 [2024-11-28 03:30:21,583 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/bin/uautomizer-verify-aQ6SnzHsRB/data/5b1f4db49/dfad87d2ba554ee5a994c5699b4bef3d [2024-11-28 03:30:21,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:30:21,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:30:21,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:30:21,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:30:21,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:30:21,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:30:21" (1/1) ... [2024-11-28 03:30:21,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68485ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:30:21, skipping insertion in model container [2024-11-28 03:30:21,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:30:21" (1/1) ... [2024-11-28 03:30:21,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:30:22,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:30:22,081 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:30:22,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:30:22,192 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:30:22,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:30:22 WrapperNode [2024-11-28 03:30:22,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:30:22,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:30:22,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:30:22,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:30:22,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:30:22" (1/1) ... [2024-11-28 03:30:22,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:30:22" (1/1) ... [2024-11-28 03:30:22,248 INFO L138 Inliner]: procedures = 161, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2024-11-28 03:30:22,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:30:22,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:30:22,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:30:22,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:30:22,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:30:22" (1/1) ... [2024-11-28 03:30:22,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:30:22" (1/1) ... [2024-11-28 03:30:22,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:30:22" (1/1) ... [2024-11-28 03:30:22,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:30:22" (1/1) ... [2024-11-28 03:30:22,271 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:30:22" (1/1) ... [2024-11-28 03:30:22,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:30:22" (1/1) ... [2024-11-28 03:30:22,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:30:22" (1/1) ... [2024-11-28 03:30:22,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:30:22" (1/1) ... [2024-11-28 03:30:22,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:30:22" (1/1) ... [2024-11-28 03:30:22,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:30:22,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:30:22,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:30:22,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:30:22,293 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:30:22" (1/1) ... [2024-11-28 03:30:22,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:30:22,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:22,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:30:22,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b47cd40-7404-4d4e-acb2-b2549612a0da/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:30:22,370 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-28 03:30:22,370 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-28 03:30:22,371 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-28 03:30:22,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:30:22,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 03:30:22,371 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-28 03:30:22,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:30:22,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:30:22,372 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:30:22,490 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:30:22,492 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:30:22,652 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:30:22,652 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:30:22,677 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:30:22,677 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 03:30:22,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:30:22 BoogieIcfgContainer [2024-11-28 03:30:22,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:30:22,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:30:22,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:30:22,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:30:22,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:30:21" (1/3) ... [2024-11-28 03:30:22,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f4a822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:30:22, skipping insertion in model container [2024-11-28 03:30:22,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:30:22" (2/3) ... [2024-11-28 03:30:22,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f4a822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:30:22, skipping insertion in model container [2024-11-28 03:30:22,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:30:22" (3/3) ... [2024-11-28 03:30:22,695 INFO L128 eAbstractionObserver]: Analyzing ICFG 14_spin2003.i [2024-11-28 03:30:22,714 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:30:22,716 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 14_spin2003.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 3 error locations. [2024-11-28 03:30:22,716 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:30:22,804 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 03:30:22,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 57 transitions, 118 flow [2024-11-28 03:30:22,938 INFO L124 PetriNetUnfolderBase]: 4/65 cut-off events. [2024-11-28 03:30:22,945 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:30:22,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 65 events. 4/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 38. Up to 4 conditions per place. [2024-11-28 03:30:22,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 57 transitions, 118 flow [2024-11-28 03:30:22,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 57 transitions, 118 flow [2024-11-28 03:30:22,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:30:23,001 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2cc574e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:30:23,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-28 03:30:23,030 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:30:23,033 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2024-11-28 03:30:23,033 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:30:23,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:30:23,034 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:23,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-28 03:30:23,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:23,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1325582974, now seen corresponding path program 1 times [2024-11-28 03:30:23,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:23,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719769261] [2024-11-28 03:30:23,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:23,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:30:23,212 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:30:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:30:23,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:30:23,275 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:30:23,276 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-28 03:30:23,278 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-28 03:30:23,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-28 03:30:23,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-28 03:30:23,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-28 03:30:23,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-28 03:30:23,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-11-28 03:30:23,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:30:23,280 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-28 03:30:23,285 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-28 03:30:23,285 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-28 03:30:23,343 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 03:30:23,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 88 transitions, 186 flow [2024-11-28 03:30:23,386 INFO L124 PetriNetUnfolderBase]: 7/104 cut-off events. [2024-11-28 03:30:23,386 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 03:30:23,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 104 events. 7/104 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 172 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 68. Up to 6 conditions per place. [2024-11-28 03:30:23,387 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 88 transitions, 186 flow [2024-11-28 03:30:23,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 88 transitions, 186 flow [2024-11-28 03:30:23,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:30:23,392 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2cc574e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:30:23,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-28 03:30:23,412 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:30:23,412 INFO L124 PetriNetUnfolderBase]: 3/48 cut-off events. [2024-11-28 03:30:23,412 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-28 03:30:23,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:30:23,413 INFO L206 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] [2024-11-28 03:30:23,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-11-28 03:30:23,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:23,414 INFO L85 PathProgramCache]: Analyzing trace with hash 853038700, now seen corresponding path program 1 times [2024-11-28 03:30:23,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:23,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181991953] [2024-11-28 03:30:23,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:23,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:30:23,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:23,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181991953] [2024-11-28 03:30:23,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181991953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:23,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:23,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:30:23,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187183423] [2024-11-28 03:30:23,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:23,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:30:23,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:30:23,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:30:23,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:30:23,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 88 [2024-11-28 03:30:23,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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) [2024-11-28 03:30:23,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:30:23,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 88 [2024-11-28 03:30:23,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:30:23,945 INFO L124 PetriNetUnfolderBase]: 57/327 cut-off events. [2024-11-28 03:30:23,945 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-28 03:30:23,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 327 events. 57/327 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1648 event pairs, 37 based on Foata normal form. 110/392 useless extension candidates. Maximal degree in co-relation 383. Up to 109 conditions per place. [2024-11-28 03:30:23,950 INFO L140 encePairwiseOnDemand]: 75/88 looper letters, 18 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2024-11-28 03:30:23,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 229 flow [2024-11-28 03:30:23,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:30:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:30:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2024-11-28 03:30:23,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8598484848484849 [2024-11-28 03:30:23,976 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 186 flow. Second operand 3 states and 227 transitions. [2024-11-28 03:30:23,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 229 flow [2024-11-28 03:30:23,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 229 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:30:23,999 INFO L231 Difference]: Finished difference. Result has 84 places, 80 transitions, 206 flow [2024-11-28 03:30:24,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=84, PETRI_TRANSITIONS=80} [2024-11-28 03:30:24,010 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -4 predicate places. [2024-11-28 03:30:24,010 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 206 flow [2024-11-28 03:30:24,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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) [2024-11-28 03:30:24,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:30:24,011 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:24,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:30:24,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-11-28 03:30:24,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash -304002418, now seen corresponding path program 1 times [2024-11-28 03:30:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:24,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128540430] [2024-11-28 03:30:24,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:24,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:30:24,068 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:30:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:30:24,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:30:24,107 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:30:24,107 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-28 03:30:24,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-28 03:30:24,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-28 03:30:24,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-28 03:30:24,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-28 03:30:24,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-28 03:30:24,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-28 03:30:24,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-28 03:30:24,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-28 03:30:24,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-28 03:30:24,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:30:24,109 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-28 03:30:24,113 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-28 03:30:24,113 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-28 03:30:24,170 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 03:30:24,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 119 transitions, 256 flow [2024-11-28 03:30:24,204 INFO L124 PetriNetUnfolderBase]: 10/143 cut-off events. [2024-11-28 03:30:24,207 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-28 03:30:24,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 10/143 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 349 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 108. Up to 8 conditions per place. [2024-11-28 03:30:24,209 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 119 transitions, 256 flow [2024-11-28 03:30:24,211 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 119 transitions, 256 flow [2024-11-28 03:30:24,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:30:24,213 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2cc574e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:30:24,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-28 03:30:24,222 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:30:24,222 INFO L124 PetriNetUnfolderBase]: 3/48 cut-off events. [2024-11-28 03:30:24,222 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-28 03:30:24,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:30:24,222 INFO L206 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] [2024-11-28 03:30:24,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-11-28 03:30:24,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash -520585010, now seen corresponding path program 1 times [2024-11-28 03:30:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:24,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717735381] [2024-11-28 03:30:24,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:24,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:30:24,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:24,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717735381] [2024-11-28 03:30:24,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717735381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:24,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:24,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:30:24,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293870159] [2024-11-28 03:30:24,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:24,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:30:24,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:30:24,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:30:24,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:30:24,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2024-11-28 03:30:24,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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) [2024-11-28 03:30:24,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:30:24,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2024-11-28 03:30:24,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:30:25,033 INFO L124 PetriNetUnfolderBase]: 783/2639 cut-off events. [2024-11-28 03:30:25,033 INFO L125 PetriNetUnfolderBase]: For 427/427 co-relation queries the response was YES. [2024-11-28 03:30:25,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4215 conditions, 2639 events. 783/2639 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 22841 event pairs, 558 based on Foata normal form. 842/3085 useless extension candidates. Maximal degree in co-relation 3328. Up to 1091 conditions per place. [2024-11-28 03:30:25,069 INFO L140 encePairwiseOnDemand]: 101/119 looper letters, 27 selfloop transitions, 9 changer transitions 0/116 dead transitions. [2024-11-28 03:30:25,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 116 transitions, 334 flow [2024-11-28 03:30:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:30:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:30:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2024-11-28 03:30:25,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.865546218487395 [2024-11-28 03:30:25,075 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 256 flow. Second operand 3 states and 309 transitions. [2024-11-28 03:30:25,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 116 transitions, 334 flow [2024-11-28 03:30:25,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 330 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-28 03:30:25,081 INFO L231 Difference]: Finished difference. Result has 113 places, 110 transitions, 290 flow [2024-11-28 03:30:25,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=113, PETRI_TRANSITIONS=110} [2024-11-28 03:30:25,085 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -6 predicate places. [2024-11-28 03:30:25,085 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 110 transitions, 290 flow [2024-11-28 03:30:25,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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) [2024-11-28 03:30:25,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:30:25,086 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2024-11-28 03:30:25,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:30:25,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-11-28 03:30:25,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:25,088 INFO L85 PathProgramCache]: Analyzing trace with hash 536064146, now seen corresponding path program 1 times [2024-11-28 03:30:25,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:25,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064610683] [2024-11-28 03:30:25,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:25,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:30:25,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:25,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064610683] [2024-11-28 03:30:25,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064610683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:25,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:25,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:30:25,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693593555] [2024-11-28 03:30:25,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:25,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:30:25,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:30:25,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:30:25,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:30:25,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2024-11-28 03:30:25,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 110 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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) [2024-11-28 03:30:25,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:30:25,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2024-11-28 03:30:25,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:30:26,014 INFO L124 PetriNetUnfolderBase]: 1172/3570 cut-off events. [2024-11-28 03:30:26,014 INFO L125 PetriNetUnfolderBase]: For 1101/1137 co-relation queries the response was YES. [2024-11-28 03:30:26,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6840 conditions, 3570 events. 1172/3570 cut-off events. For 1101/1137 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 31946 event pairs, 677 based on Foata normal form. 0/3060 useless extension candidates. Maximal degree in co-relation 6741. Up to 1502 conditions per place. [2024-11-28 03:30:26,058 INFO L140 encePairwiseOnDemand]: 109/119 looper letters, 31 selfloop transitions, 13 changer transitions 0/126 dead transitions. [2024-11-28 03:30:26,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 126 transitions, 437 flow [2024-11-28 03:30:26,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:30:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:30:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2024-11-28 03:30:26,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8235294117647058 [2024-11-28 03:30:26,061 INFO L175 Difference]: Start difference. First operand has 113 places, 110 transitions, 290 flow. Second operand 3 states and 294 transitions. [2024-11-28 03:30:26,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 126 transitions, 437 flow [2024-11-28 03:30:26,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 126 transitions, 411 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:30:26,086 INFO L231 Difference]: Finished difference. Result has 115 places, 121 transitions, 384 flow [2024-11-28 03:30:26,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=115, PETRI_TRANSITIONS=121} [2024-11-28 03:30:26,088 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -4 predicate places. [2024-11-28 03:30:26,089 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 121 transitions, 384 flow [2024-11-28 03:30:26,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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) [2024-11-28 03:30:26,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:30:26,089 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:26,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:30:26,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-11-28 03:30:26,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:26,090 INFO L85 PathProgramCache]: Analyzing trace with hash 295804794, now seen corresponding path program 1 times [2024-11-28 03:30:26,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:26,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040869858] [2024-11-28 03:30:26,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:26,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:30:26,124 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:30:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:30:26,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:30:26,160 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:30:26,161 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-11-28 03:30:26,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-11-28 03:30:26,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-11-28 03:30:26,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-11-28 03:30:26,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-11-28 03:30:26,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-11-28 03:30:26,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-11-28 03:30:26,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-11-28 03:30:26,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-11-28 03:30:26,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-11-28 03:30:26,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-11-28 03:30:26,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-11-28 03:30:26,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-11-28 03:30:26,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:30:26,166 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-28 03:30:26,166 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-28 03:30:26,167 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-28 03:30:26,230 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 03:30:26,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 150 transitions, 328 flow [2024-11-28 03:30:26,278 INFO L124 PetriNetUnfolderBase]: 13/182 cut-off events. [2024-11-28 03:30:26,278 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-28 03:30:26,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 182 events. 13/182 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 530 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 151. Up to 10 conditions per place. [2024-11-28 03:30:26,280 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 150 transitions, 328 flow [2024-11-28 03:30:26,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 150 transitions, 328 flow [2024-11-28 03:30:26,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:30:26,286 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2cc574e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:30:26,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-28 03:30:26,298 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:30:26,298 INFO L124 PetriNetUnfolderBase]: 3/51 cut-off events. [2024-11-28 03:30:26,298 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-28 03:30:26,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:30:26,299 INFO L206 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] [2024-11-28 03:30:26,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-28 03:30:26,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:26,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1137469006, now seen corresponding path program 1 times [2024-11-28 03:30:26,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:26,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503470784] [2024-11-28 03:30:26,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:26,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:30:26,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:26,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503470784] [2024-11-28 03:30:26,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503470784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:26,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:26,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:30:26,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076771978] [2024-11-28 03:30:26,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:26,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:30:26,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:30:26,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:30:26,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:30:26,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 150 [2024-11-28 03:30:26,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 150 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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) [2024-11-28 03:30:26,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:30:26,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 150 [2024-11-28 03:30:26,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:30:29,580 INFO L124 PetriNetUnfolderBase]: 7395/19445 cut-off events. [2024-11-28 03:30:29,580 INFO L125 PetriNetUnfolderBase]: For 4630/4630 co-relation queries the response was YES. [2024-11-28 03:30:29,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32302 conditions, 19445 events. 7395/19445 cut-off events. For 4630/4630 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 214783 event pairs, 5493 based on Foata normal form. 6058/22743 useless extension candidates. Maximal degree in co-relation 25149. Up to 9127 conditions per place. [2024-11-28 03:30:29,786 INFO L140 encePairwiseOnDemand]: 127/150 looper letters, 36 selfloop transitions, 12 changer transitions 0/149 dead transitions. [2024-11-28 03:30:29,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 149 transitions, 443 flow [2024-11-28 03:30:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:30:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:30:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2024-11-28 03:30:29,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8688888888888889 [2024-11-28 03:30:29,791 INFO L175 Difference]: Start difference. First operand has 150 places, 150 transitions, 328 flow. Second operand 3 states and 391 transitions. [2024-11-28 03:30:29,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 149 transitions, 443 flow [2024-11-28 03:30:29,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 149 transitions, 431 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-11-28 03:30:29,798 INFO L231 Difference]: Finished difference. Result has 142 places, 140 transitions, 374 flow [2024-11-28 03:30:29,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=142, PETRI_TRANSITIONS=140} [2024-11-28 03:30:29,800 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -8 predicate places. [2024-11-28 03:30:29,800 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 140 transitions, 374 flow [2024-11-28 03:30:29,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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) [2024-11-28 03:30:29,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:30:29,801 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2024-11-28 03:30:29,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:30:29,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-28 03:30:29,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:29,802 INFO L85 PathProgramCache]: Analyzing trace with hash 272641204, now seen corresponding path program 1 times [2024-11-28 03:30:29,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:29,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800678278] [2024-11-28 03:30:29,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:29,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:30:29,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:29,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800678278] [2024-11-28 03:30:29,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800678278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:29,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:29,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:30:29,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9856420] [2024-11-28 03:30:29,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:29,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:30:29,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:30:29,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:30:29,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:30:29,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 150 [2024-11-28 03:30:29,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 140 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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) [2024-11-28 03:30:29,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:30:29,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 150 [2024-11-28 03:30:29,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:30:33,533 INFO L124 PetriNetUnfolderBase]: 11941/28835 cut-off events. [2024-11-28 03:30:33,533 INFO L125 PetriNetUnfolderBase]: For 9738/10595 co-relation queries the response was YES. [2024-11-28 03:30:33,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57848 conditions, 28835 events. 11941/28835 cut-off events. For 9738/10595 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 323261 event pairs, 7371 based on Foata normal form. 15/24818 useless extension candidates. Maximal degree in co-relation 57748. Up to 13802 conditions per place. [2024-11-28 03:30:33,807 INFO L140 encePairwiseOnDemand]: 137/150 looper letters, 43 selfloop transitions, 19 changer transitions 0/165 dead transitions. [2024-11-28 03:30:33,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 165 transitions, 598 flow [2024-11-28 03:30:33,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:30:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:30:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2024-11-28 03:30:33,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2024-11-28 03:30:33,809 INFO L175 Difference]: Start difference. First operand has 142 places, 140 transitions, 374 flow. Second operand 3 states and 372 transitions. [2024-11-28 03:30:33,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 165 transitions, 598 flow [2024-11-28 03:30:33,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 165 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:30:33,911 INFO L231 Difference]: Finished difference. Result has 144 places, 157 transitions, 522 flow [2024-11-28 03:30:33,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=144, PETRI_TRANSITIONS=157} [2024-11-28 03:30:33,914 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -6 predicate places. [2024-11-28 03:30:33,916 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 157 transitions, 522 flow [2024-11-28 03:30:33,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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) [2024-11-28 03:30:33,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:30:33,917 INFO L206 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, 1, 1, 1] [2024-11-28 03:30:33,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:30:33,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-28 03:30:33,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash -253270905, now seen corresponding path program 1 times [2024-11-28 03:30:33,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:33,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277198974] [2024-11-28 03:30:33,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:33,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:30:33,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:33,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277198974] [2024-11-28 03:30:33,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277198974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:33,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:33,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:30:33,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234406342] [2024-11-28 03:30:33,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:33,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:30:33,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:30:33,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:30:33,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:30:34,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 150 [2024-11-28 03:30:34,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 157 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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) [2024-11-28 03:30:34,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:30:34,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 150 [2024-11-28 03:30:34,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:30:37,845 INFO L124 PetriNetUnfolderBase]: 15835/37991 cut-off events. [2024-11-28 03:30:37,845 INFO L125 PetriNetUnfolderBase]: For 28313/30201 co-relation queries the response was YES. [2024-11-28 03:30:37,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87085 conditions, 37991 events. 15835/37991 cut-off events. For 28313/30201 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 441902 event pairs, 8895 based on Foata normal form. 23/32240 useless extension candidates. Maximal degree in co-relation 86963. Up to 17896 conditions per place. [2024-11-28 03:30:38,262 INFO L140 encePairwiseOnDemand]: 137/150 looper letters, 59 selfloop transitions, 19 changer transitions 0/183 dead transitions. [2024-11-28 03:30:38,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 183 transitions, 815 flow [2024-11-28 03:30:38,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:30:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:30:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2024-11-28 03:30:38,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8288888888888889 [2024-11-28 03:30:38,266 INFO L175 Difference]: Start difference. First operand has 144 places, 157 transitions, 522 flow. Second operand 3 states and 373 transitions. [2024-11-28 03:30:38,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 183 transitions, 815 flow [2024-11-28 03:30:38,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 183 transitions, 763 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:30:38,434 INFO L231 Difference]: Finished difference. Result has 146 places, 174 transitions, 686 flow [2024-11-28 03:30:38,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=146, PETRI_TRANSITIONS=174} [2024-11-28 03:30:38,438 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -4 predicate places. [2024-11-28 03:30:38,438 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 174 transitions, 686 flow [2024-11-28 03:30:38,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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) [2024-11-28 03:30:38,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:30:38,439 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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] [2024-11-28 03:30:38,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:30:38,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-28 03:30:38,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:38,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2140694657, now seen corresponding path program 1 times [2024-11-28 03:30:38,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:38,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339780724] [2024-11-28 03:30:38,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:30:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339780724] [2024-11-28 03:30:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339780724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:38,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:30:38,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332398669] [2024-11-28 03:30:38,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:38,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:30:38,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:30:38,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:30:38,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:30:38,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 150 [2024-11-28 03:30:38,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 174 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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) [2024-11-28 03:30:38,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:30:38,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 150 [2024-11-28 03:30:38,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:30:44,573 INFO L124 PetriNetUnfolderBase]: 25435/56087 cut-off events. [2024-11-28 03:30:44,573 INFO L125 PetriNetUnfolderBase]: For 71798/73994 co-relation queries the response was YES. [2024-11-28 03:30:44,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146549 conditions, 56087 events. 25435/56087 cut-off events. For 71798/73994 co-relation queries the response was YES. Maximal size of possible extension queue 2077. Compared 650241 event pairs, 11736 based on Foata normal form. 56/46915 useless extension candidates. Maximal degree in co-relation 146440. Up to 26863 conditions per place. [2024-11-28 03:30:45,130 INFO L140 encePairwiseOnDemand]: 137/150 looper letters, 68 selfloop transitions, 41 changer transitions 0/216 dead transitions. [2024-11-28 03:30:45,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 216 transitions, 1167 flow [2024-11-28 03:30:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:30:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:30:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2024-11-28 03:30:45,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8244444444444444 [2024-11-28 03:30:45,132 INFO L175 Difference]: Start difference. First operand has 146 places, 174 transitions, 686 flow. Second operand 3 states and 371 transitions. [2024-11-28 03:30:45,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 216 transitions, 1167 flow [2024-11-28 03:30:45,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 216 transitions, 1059 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-11-28 03:30:45,514 INFO L231 Difference]: Finished difference. Result has 148 places, 209 transitions, 1058 flow [2024-11-28 03:30:45,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1058, PETRI_PLACES=148, PETRI_TRANSITIONS=209} [2024-11-28 03:30:45,514 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -2 predicate places. [2024-11-28 03:30:45,515 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 209 transitions, 1058 flow [2024-11-28 03:30:45,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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) [2024-11-28 03:30:45,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:30:45,515 INFO L206 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, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:45,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:30:45,515 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-28 03:30:45,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:45,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1064604051, now seen corresponding path program 1 times [2024-11-28 03:30:45,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:30:45,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124884317] [2024-11-28 03:30:45,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:45,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:30:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:30:45,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:30:45,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124884317] [2024-11-28 03:30:45,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124884317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:45,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:45,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:30:45,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455435374] [2024-11-28 03:30:45,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:45,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:30:45,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:30:45,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:30:45,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:30:45,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 150 [2024-11-28 03:30:45,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 209 transitions, 1058 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2024-11-28 03:30:45,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:30:45,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 150 [2024-11-28 03:30:45,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:30:50,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([507] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][286], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 17#L691-2true, 147#true, 124#L698-5true, 7#L690-3true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 126#L689-4true]) [2024-11-28 03:30:50,910 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2024-11-28 03:30:50,910 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:30:50,910 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:30:50,910 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:30:51,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][285], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 17#L691-2true, 147#true, 124#L698-5true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 126#L689-4true]) [2024-11-28 03:30:51,227 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2024-11-28 03:30:51,227 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:30:51,228 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:30:51,228 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:30:51,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][284], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 163#true, 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 17#L691-2true, 147#true, 124#L698-5true, 35#L690-3true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:51,269 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2024-11-28 03:30:51,269 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:30:51,269 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:30:51,269 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:30:52,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][284], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, 83#L689-4true, 145#true, Black: 163#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 147#true, 124#L698-5true, 35#L690-3true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:52,066 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2024-11-28 03:30:52,067 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-11-28 03:30:52,067 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-11-28 03:30:52,067 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-11-28 03:30:52,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][285], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, 83#L689-4true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 147#true, 124#L698-5true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 126#L689-4true]) [2024-11-28 03:30:52,116 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2024-11-28 03:30:52,117 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-11-28 03:30:52,117 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-11-28 03:30:52,117 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-11-28 03:30:52,121 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([507] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][286], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 147#true, 124#L698-5true, 7#L690-3true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 126#L689-4true]) [2024-11-28 03:30:52,122 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2024-11-28 03:30:52,122 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-11-28 03:30:52,122 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-11-28 03:30:52,122 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-11-28 03:30:53,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][295], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 17#L691-2true, 147#true, 124#L698-5true, 143#L691-1true, 175#(= |#race~x~0| 0), 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:53,679 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-11-28 03:30:53,679 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-28 03:30:53,679 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-28 03:30:53,679 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-28 03:30:53,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([507] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][297], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 109#L690-4true, 173#true, 17#L691-2true, 147#true, 124#L698-5true, 7#L690-3true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:53,727 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2024-11-28 03:30:53,727 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-28 03:30:53,727 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-28 03:30:53,727 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-28 03:30:53,752 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][296], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, 109#L690-4true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 17#L691-2true, 147#true, 124#L698-5true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:53,752 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2024-11-28 03:30:53,752 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-28 03:30:53,752 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-28 03:30:53,752 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-28 03:30:54,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][295], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, 83#L689-4true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 147#true, 124#L698-5true, 143#L691-1true, 175#(= |#race~x~0| 0), 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:54,467 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2024-11-28 03:30:54,467 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-28 03:30:54,467 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-28 03:30:54,467 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-28 03:30:54,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][296], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, 83#L689-4true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, 109#L690-4true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 147#true, 124#L698-5true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:54,730 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2024-11-28 03:30:54,730 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-28 03:30:54,730 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-28 03:30:54,730 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-28 03:30:54,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([507] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][297], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 109#L690-4true, 173#true, 147#true, 124#L698-5true, 7#L690-3true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:54,784 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2024-11-28 03:30:54,784 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-28 03:30:54,784 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-28 03:30:54,784 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-28 03:30:55,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][132], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 47#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 147#true, 124#L698-5true, 168#true, 129#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:55,135 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2024-11-28 03:30:55,135 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-28 03:30:55,135 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-28 03:30:55,135 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-28 03:30:56,522 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 63#L691-2true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 17#L691-2true, 147#true, 124#L698-5true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:56,522 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-28 03:30:56,522 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-28 03:30:56,522 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-28 03:30:56,522 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-28 03:30:56,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 163#true, 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 102#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 17#L691-2true, 147#true, 124#L698-5true, 35#L690-3true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:56,631 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-28 03:30:56,631 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-28 03:30:56,631 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-28 03:30:56,631 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-28 03:30:56,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([507] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 3#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 63#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 17#L691-2true, 147#true, 124#L698-5true, 7#L690-3true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:56,644 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-28 03:30:56,644 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-28 03:30:56,644 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-28 03:30:56,644 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-28 03:30:57,587 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 88#L692-2true, 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 17#L691-2true, 147#true, 124#L698-5true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:57,587 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,587 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,587 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,587 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 63#L691-2true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 147#true, 124#L698-5true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:57,589 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,589 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,589 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,589 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 145#true, Black: 163#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 81#L692-2true, 17#L691-2true, 147#true, 124#L698-5true, 35#L690-3true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:57,718 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,718 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,719 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,719 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 163#true, 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 102#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 147#true, 124#L698-5true, 35#L690-3true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:57,720 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,720 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,720 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,720 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([507] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 88#L692-2true, 145#true, 3#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 17#L691-2true, 147#true, 124#L698-5true, 7#L690-3true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:57,736 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,737 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,737 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,737 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,744 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([507] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 3#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 63#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 147#true, 124#L698-5true, 7#L690-3true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:57,744 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,744 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,744 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,744 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-28 03:30:57,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 102#L691-2true, 151#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 149#true, 17#L691-2true, 147#true, 124#L698-5true, 143#L691-1true, 175#(= |#race~x~0| 0), 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:57,963 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-28 03:30:57,963 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-28 03:30:57,963 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-28 03:30:57,963 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-28 03:30:58,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 88#L692-2true, 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 147#true, 124#L698-5true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:58,293 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2024-11-28 03:30:58,293 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-28 03:30:58,293 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-28 03:30:58,293 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-28 03:30:58,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 163#true, 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 81#L692-2true, 147#true, 124#L698-5true, 35#L690-3true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:58,428 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2024-11-28 03:30:58,428 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-28 03:30:58,428 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-28 03:30:58,428 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-28 03:30:58,441 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([507] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 88#L692-2true, 145#true, 3#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 147#true, 124#L698-5true, 7#L690-3true, 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:58,441 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2024-11-28 03:30:58,441 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-28 03:30:58,442 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-28 03:30:58,442 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-28 03:30:58,608 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 81#L692-2true, 17#L691-2true, 147#true, 124#L698-5true, 143#L691-1true, 175#(= |#race~x~0| 0), 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:58,608 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-28 03:30:58,608 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-28 03:30:58,608 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-28 03:30:58,608 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-28 03:30:58,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 102#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 147#true, 124#L698-5true, 143#L691-1true, 175#(= |#race~x~0| 0), 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:58,609 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-28 03:30:58,609 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-28 03:30:58,610 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-28 03:30:58,610 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-28 03:30:59,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 81#L692-2true, 147#true, 124#L698-5true, 143#L691-1true, 175#(= |#race~x~0| 0), 168#true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-28 03:30:59,495 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2024-11-28 03:30:59,495 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-28 03:30:59,495 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-28 03:30:59,495 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-28 03:31:00,253 INFO L124 PetriNetUnfolderBase]: 58260/134342 cut-off events. [2024-11-28 03:31:00,253 INFO L125 PetriNetUnfolderBase]: For 284868/290154 co-relation queries the response was YES. [2024-11-28 03:31:00,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378714 conditions, 134342 events. 58260/134342 cut-off events. For 284868/290154 co-relation queries the response was YES. Maximal size of possible extension queue 4639. Compared 1777291 event pairs, 12497 based on Foata normal form. 113/110767 useless extension candidates. Maximal degree in co-relation 378586. Up to 37476 conditions per place. [2024-11-28 03:31:01,745 INFO L140 encePairwiseOnDemand]: 130/150 looper letters, 113 selfloop transitions, 84 changer transitions 0/302 dead transitions. [2024-11-28 03:31:01,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 302 transitions, 2179 flow [2024-11-28 03:31:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:31:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:31:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2024-11-28 03:31:01,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-11-28 03:31:01,749 INFO L175 Difference]: Start difference. First operand has 148 places, 209 transitions, 1058 flow. Second operand 3 states and 375 transitions. [2024-11-28 03:31:01,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 302 transitions, 2179 flow [2024-11-28 03:31:03,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 302 transitions, 2031 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:31:03,199 INFO L231 Difference]: Finished difference. Result has 150 places, 291 transitions, 2108 flow [2024-11-28 03:31:03,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2108, PETRI_PLACES=150, PETRI_TRANSITIONS=291} [2024-11-28 03:31:03,200 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 0 predicate places. [2024-11-28 03:31:03,200 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 291 transitions, 2108 flow [2024-11-28 03:31:03,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2024-11-28 03:31:03,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:31:03,200 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:31:03,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:31:03,201 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-28 03:31:03,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:31:03,201 INFO L85 PathProgramCache]: Analyzing trace with hash -791569278, now seen corresponding path program 1 times [2024-11-28 03:31:03,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:31:03,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678455290] [2024-11-28 03:31:03,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:31:03,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:31:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:31:03,214 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:31:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:31:03,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:31:03,227 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:31:03,227 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-28 03:31:03,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-28 03:31:03,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-28 03:31:03,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-28 03:31:03,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-28 03:31:03,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-28 03:31:03,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-28 03:31:03,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-28 03:31:03,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-28 03:31:03,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-28 03:31:03,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-28 03:31:03,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-28 03:31:03,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-28 03:31:03,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-28 03:31:03,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-28 03:31:03,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-28 03:31:03,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:31:03,229 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-28 03:31:03,230 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-28 03:31:03,230 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-28 03:31:03,260 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 03:31:03,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 181 transitions, 402 flow [2024-11-28 03:31:03,285 INFO L124 PetriNetUnfolderBase]: 16/221 cut-off events. [2024-11-28 03:31:03,285 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-28 03:31:03,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 221 events. 16/221 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 729 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 195. Up to 12 conditions per place. [2024-11-28 03:31:03,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 181 transitions, 402 flow [2024-11-28 03:31:03,289 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 181 transitions, 402 flow [2024-11-28 03:31:03,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:31:03,291 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2cc574e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:31:03,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-11-28 03:31:03,293 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:31:03,294 INFO L124 PetriNetUnfolderBase]: 3/48 cut-off events. [2024-11-28 03:31:03,294 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-28 03:31:03,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:31:03,294 INFO L206 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] [2024-11-28 03:31:03,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2024-11-28 03:31:03,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:31:03,295 INFO L85 PathProgramCache]: Analyzing trace with hash 598769746, now seen corresponding path program 1 times [2024-11-28 03:31:03,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:31:03,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134617081] [2024-11-28 03:31:03,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:31:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:31:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:31:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:31:03,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:31:03,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134617081] [2024-11-28 03:31:03,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134617081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:31:03,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:31:03,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:31:03,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977708325] [2024-11-28 03:31:03,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:31:03,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:31:03,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:31:03,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:31:03,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:31:03,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 181 [2024-11-28 03:31:03,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 181 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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) [2024-11-28 03:31:03,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:31:03,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 181 [2024-11-28 03:31:03,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand