./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-word-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-word-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd --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 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:03:47,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:03:47,686 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-13 16:03:47,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:03:47,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:03:47,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:03:47,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:03:47,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:03:47,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:03:47,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:03:47,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:03:47,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:03:47,725 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:03:47,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:03:47,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:03:47,726 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:03:47,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:03:47,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:03:47,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:03:47,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:03:47,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:03:47,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:03:47,727 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 16:03:47,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:03:47,728 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 16:03:47,728 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:03:47,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:03:47,728 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:03:47,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:03:47,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:03:47,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:03:47,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:03:47,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:03:47,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:03:47,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:03:47,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:03:47,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:03:47,730 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:03:47,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:03:47,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:03:47,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:03:47,730 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_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd 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 -> 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 [2024-11-13 16:03:48,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:03:48,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:03:48,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:03:48,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:03:48,138 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:03:48,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/weaver/chl-word-subst.wvr.c Unable to find full path for "g++" [2024-11-13 16:03:50,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:03:50,815 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:03:50,818 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2024-11-13 16:03:50,838 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd/data/e1e408666/97b788dd047b4f309878337ecfc8794f/FLAG826ff043d [2024-11-13 16:03:50,873 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd/data/e1e408666/97b788dd047b4f309878337ecfc8794f [2024-11-13 16:03:50,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:03:50,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:03:50,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:03:50,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:03:50,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:03:50,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:03:50" (1/1) ... [2024-11-13 16:03:50,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e603a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:03:50, skipping insertion in model container [2024-11-13 16:03:50,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:03:50" (1/1) ... [2024-11-13 16:03:50,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:03:51,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:03:51,270 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:03:51,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:03:51,369 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:03:51,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:03:51 WrapperNode [2024-11-13 16:03:51,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:03:51,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:03:51,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:03:51,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:03:51,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:03:51" (1/1) ... [2024-11-13 16:03:51,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:03:51" (1/1) ... [2024-11-13 16:03:51,426 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 245 [2024-11-13 16:03:51,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:03:51,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:03:51,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:03:51,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:03:51,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:03:51" (1/1) ... [2024-11-13 16:03:51,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:03:51" (1/1) ... [2024-11-13 16:03:51,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:03:51" (1/1) ... [2024-11-13 16:03:51,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:03:51" (1/1) ... [2024-11-13 16:03:51,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:03:51" (1/1) ... [2024-11-13 16:03:51,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:03:51" (1/1) ... [2024-11-13 16:03:51,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:03:51" (1/1) ... [2024-11-13 16:03:51,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:03:51" (1/1) ... [2024-11-13 16:03:51,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:03:51,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:03:51,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:03:51,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:03:51,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:03:51" (1/1) ... [2024-11-13 16:03:51,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:03:51,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:03:51,576 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:03:51,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:03:51,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:03:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-13 16:03:51,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-13 16:03:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-13 16:03:51,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-13 16:03:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-13 16:03:51,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-13 16:03:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 16:03:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 16:03:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 16:03:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:03:51,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:03:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 16:03:51,626 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 16:03:51,833 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:03:51,837 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:03:53,336 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 16:03:53,337 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:03:53,366 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:03:53,366 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-13 16:03:53,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:03:53 BoogieIcfgContainer [2024-11-13 16:03:53,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:03:53,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:03:53,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:03:53,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:03:53,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:03:50" (1/3) ... [2024-11-13 16:03:53,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a45cc1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:03:53, skipping insertion in model container [2024-11-13 16:03:53,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:03:51" (2/3) ... [2024-11-13 16:03:53,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a45cc1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:03:53, skipping insertion in model container [2024-11-13 16:03:53,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:03:53" (3/3) ... [2024-11-13 16:03:53,379 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2024-11-13 16:03:53,399 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:03:53,401 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-subst.wvr.c that has 4 procedures, 623 locations, 1 initial locations, 6 loop locations, and 77 error locations. [2024-11-13 16:03:53,401 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 16:03:53,670 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-13 16:03:53,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 632 places, 655 transitions, 1331 flow [2024-11-13 16:03:54,258 INFO L124 PetriNetUnfolderBase]: 33/652 cut-off events. [2024-11-13 16:03:54,262 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 16:03:54,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 652 events. 33/652 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1731 event pairs, 0 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 493. Up to 3 conditions per place. [2024-11-13 16:03:54,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 632 places, 655 transitions, 1331 flow [2024-11-13 16:03:54,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 611 places, 632 transitions, 1282 flow [2024-11-13 16:03:54,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:03:54,354 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;@4f3c8672, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:03:54,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 137 error locations. [2024-11-13 16:03:54,363 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 16:03:54,363 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-11-13 16:03:54,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 16:03:54,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:03:54,365 INFO L204 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] [2024-11-13 16:03:54,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:03:54,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:03:54,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1309066938, now seen corresponding path program 1 times [2024-11-13 16:03:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:03:54,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363829284] [2024-11-13 16:03:54,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:03:54,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:03:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:54,618 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-13 16:03:54,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:03:54,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363829284] [2024-11-13 16:03:54,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363829284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:03:54,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:03:54,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:03:54,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449907207] [2024-11-13 16:03:54,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:03:54,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:03:54,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:03:54,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:03:54,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:03:54,731 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-13 16:03:54,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 632 transitions, 1282 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-13 16:03:54,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:03:54,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-13 16:03:54,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:03:55,360 INFO L124 PetriNetUnfolderBase]: 78/1518 cut-off events. [2024-11-13 16:03:55,360 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-13 16:03:55,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1518 events. 78/1518 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9273 event pairs, 20 based on Foata normal form. 30/1249 useless extension candidates. Maximal degree in co-relation 1200. Up to 50 conditions per place. [2024-11-13 16:03:55,391 INFO L140 encePairwiseOnDemand]: 639/655 looper letters, 13 selfloop transitions, 2 changer transitions 7/618 dead transitions. [2024-11-13 16:03:55,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 618 transitions, 1284 flow [2024-11-13 16:03:55,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:03:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:03:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1898 transitions. [2024-11-13 16:03:55,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9659033078880407 [2024-11-13 16:03:55,421 INFO L175 Difference]: Start difference. First operand has 611 places, 632 transitions, 1282 flow. Second operand 3 states and 1898 transitions. [2024-11-13 16:03:55,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 618 transitions, 1284 flow [2024-11-13 16:03:55,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 618 transitions, 1272 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-13 16:03:55,454 INFO L231 Difference]: Finished difference. Result has 606 places, 611 transitions, 1232 flow [2024-11-13 16:03:55,458 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=606, PETRI_TRANSITIONS=611} [2024-11-13 16:03:55,462 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -5 predicate places. [2024-11-13 16:03:55,462 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 611 transitions, 1232 flow [2024-11-13 16:03:55,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-13 16:03:55,463 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:03:55,464 INFO L204 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, 1] [2024-11-13 16:03:55,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:03:55,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:03:55,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:03:55,468 INFO L85 PathProgramCache]: Analyzing trace with hash 74506992, now seen corresponding path program 1 times [2024-11-13 16:03:55,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:03:55,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852100180] [2024-11-13 16:03:55,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:03:55,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:03:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:55,572 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-13 16:03:55,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:03:55,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852100180] [2024-11-13 16:03:55,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852100180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:03:55,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:03:55,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:03:55,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626813164] [2024-11-13 16:03:55,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:03:55,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:03:55,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:03:55,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:03:55,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:03:55,639 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-13 16:03:55,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 611 transitions, 1232 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-13 16:03:55,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:03:55,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-13 16:03:55,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:03:56,126 INFO L124 PetriNetUnfolderBase]: 50/1054 cut-off events. [2024-11-13 16:03:56,126 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 16:03:56,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 1054 events. 50/1054 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5171 event pairs, 12 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 1068. Up to 38 conditions per place. [2024-11-13 16:03:56,168 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/610 dead transitions. [2024-11-13 16:03:56,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 610 transitions, 1260 flow [2024-11-13 16:03:56,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:03:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:03:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-13 16:03:56,179 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-11-13 16:03:56,179 INFO L175 Difference]: Start difference. First operand has 606 places, 611 transitions, 1232 flow. Second operand 3 states and 1885 transitions. [2024-11-13 16:03:56,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 610 transitions, 1260 flow [2024-11-13 16:03:56,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 610 transitions, 1256 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:03:56,200 INFO L231 Difference]: Finished difference. Result has 598 places, 610 transitions, 1230 flow [2024-11-13 16:03:56,201 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1230, PETRI_PLACES=598, PETRI_TRANSITIONS=610} [2024-11-13 16:03:56,202 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -13 predicate places. [2024-11-13 16:03:56,203 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 610 transitions, 1230 flow [2024-11-13 16:03:56,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-13 16:03:56,206 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:03:56,206 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:03:56,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:03:56,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:03:56,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:03:56,208 INFO L85 PathProgramCache]: Analyzing trace with hash -595050650, now seen corresponding path program 1 times [2024-11-13 16:03:56,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:03:56,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693057893] [2024-11-13 16:03:56,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:03:56,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:03:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:56,337 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-13 16:03:56,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:03:56,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693057893] [2024-11-13 16:03:56,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693057893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:03:56,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:03:56,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:03:56,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188446932] [2024-11-13 16:03:56,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:03:56,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:03:56,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:03:56,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:03:56,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:03:56,445 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-13 16:03:56,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 610 transitions, 1230 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-13 16:03:56,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:03:56,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-13 16:03:56,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:03:56,965 INFO L124 PetriNetUnfolderBase]: 78/1485 cut-off events. [2024-11-13 16:03:56,965 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-11-13 16:03:56,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 1485 events. 78/1485 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8462 event pairs, 20 based on Foata normal form. 0/1205 useless extension candidates. Maximal degree in co-relation 1501. Up to 50 conditions per place. [2024-11-13 16:03:56,998 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2024-11-13 16:03:56,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 609 transitions, 1258 flow [2024-11-13 16:03:57,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:03:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:03:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-13 16:03:57,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-11-13 16:03:57,007 INFO L175 Difference]: Start difference. First operand has 598 places, 610 transitions, 1230 flow. Second operand 3 states and 1885 transitions. [2024-11-13 16:03:57,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 609 transitions, 1258 flow [2024-11-13 16:03:57,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 609 transitions, 1254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:03:57,019 INFO L231 Difference]: Finished difference. Result has 597 places, 609 transitions, 1228 flow [2024-11-13 16:03:57,020 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1228, PETRI_PLACES=597, PETRI_TRANSITIONS=609} [2024-11-13 16:03:57,021 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -14 predicate places. [2024-11-13 16:03:57,021 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 609 transitions, 1228 flow [2024-11-13 16:03:57,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-13 16:03:57,023 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:03:57,023 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:03:57,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 16:03:57,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:03:57,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:03:57,025 INFO L85 PathProgramCache]: Analyzing trace with hash 491758414, now seen corresponding path program 1 times [2024-11-13 16:03:57,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:03:57,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965133027] [2024-11-13 16:03:57,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:03:57,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:03:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:57,143 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-13 16:03:57,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:03:57,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965133027] [2024-11-13 16:03:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965133027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:03:57,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:03:57,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:03:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025365789] [2024-11-13 16:03:57,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:03:57,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:03:57,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:03:57,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:03:57,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:03:57,216 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 655 [2024-11-13 16:03:57,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 609 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-13 16:03:57,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:03:57,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 655 [2024-11-13 16:03:57,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:03:57,788 INFO L124 PetriNetUnfolderBase]: 88/1786 cut-off events. [2024-11-13 16:03:57,788 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 16:03:57,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1856 conditions, 1786 events. 88/1786 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11568 event pairs, 20 based on Foata normal form. 0/1448 useless extension candidates. Maximal degree in co-relation 1803. Up to 51 conditions per place. [2024-11-13 16:03:57,889 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/608 dead transitions. [2024-11-13 16:03:57,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 608 transitions, 1258 flow [2024-11-13 16:03:57,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:03:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:03:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2024-11-13 16:03:57,897 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9582697201017811 [2024-11-13 16:03:57,898 INFO L175 Difference]: Start difference. First operand has 597 places, 609 transitions, 1228 flow. Second operand 3 states and 1883 transitions. [2024-11-13 16:03:57,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 608 transitions, 1258 flow [2024-11-13 16:03:57,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 608 transitions, 1254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:03:57,913 INFO L231 Difference]: Finished difference. Result has 596 places, 608 transitions, 1226 flow [2024-11-13 16:03:57,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1226, PETRI_PLACES=596, PETRI_TRANSITIONS=608} [2024-11-13 16:03:57,918 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -15 predicate places. [2024-11-13 16:03:57,919 INFO L471 AbstractCegarLoop]: Abstraction has has 596 places, 608 transitions, 1226 flow [2024-11-13 16:03:57,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-13 16:03:57,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:03:57,920 INFO L204 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, 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-13 16:03:57,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:03:57,921 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:03:57,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:03:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1749299654, now seen corresponding path program 1 times [2024-11-13 16:03:57,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:03:57,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125630086] [2024-11-13 16:03:57,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:03:57,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:03:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:58,041 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-13 16:03:58,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:03:58,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125630086] [2024-11-13 16:03:58,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125630086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:03:58,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:03:58,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:03:58,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759083570] [2024-11-13 16:03:58,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:03:58,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:03:58,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:03:58,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:03:58,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:03:58,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 655 [2024-11-13 16:03:58,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 608 transitions, 1226 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-13 16:03:58,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:03:58,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 655 [2024-11-13 16:03:58,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:03:58,473 INFO L124 PetriNetUnfolderBase]: 50/1089 cut-off events. [2024-11-13 16:03:58,473 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-13 16:03:58,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 1089 events. 50/1089 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5554 event pairs, 12 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1080. Up to 39 conditions per place. [2024-11-13 16:03:58,498 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/607 dead transitions. [2024-11-13 16:03:58,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 607 transitions, 1256 flow [2024-11-13 16:03:58,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:03:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:03:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2024-11-13 16:03:58,504 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9582697201017811 [2024-11-13 16:03:58,504 INFO L175 Difference]: Start difference. First operand has 596 places, 608 transitions, 1226 flow. Second operand 3 states and 1883 transitions. [2024-11-13 16:03:58,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 607 transitions, 1256 flow [2024-11-13 16:03:58,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 607 transitions, 1252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:03:58,518 INFO L231 Difference]: Finished difference. Result has 595 places, 607 transitions, 1224 flow [2024-11-13 16:03:58,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1224, PETRI_PLACES=595, PETRI_TRANSITIONS=607} [2024-11-13 16:03:58,523 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -16 predicate places. [2024-11-13 16:03:58,524 INFO L471 AbstractCegarLoop]: Abstraction has has 595 places, 607 transitions, 1224 flow [2024-11-13 16:03:58,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-13 16:03:58,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:03:58,526 INFO L204 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, 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-13 16:03:58,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:03:58,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:03:58,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:03:58,528 INFO L85 PathProgramCache]: Analyzing trace with hash 2050400413, now seen corresponding path program 1 times [2024-11-13 16:03:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:03:58,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169499450] [2024-11-13 16:03:58,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:03:58,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:03:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:58,662 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-13 16:03:58,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:03:58,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169499450] [2024-11-13 16:03:58,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169499450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:03:58,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:03:58,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:03:58,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024999830] [2024-11-13 16:03:58,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:03:58,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:03:58,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:03:58,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:03:58,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:03:58,723 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 655 [2024-11-13 16:03:58,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 607 transitions, 1224 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-13 16:03:58,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:03:58,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 655 [2024-11-13 16:03:58,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:03:59,093 INFO L124 PetriNetUnfolderBase]: 48/866 cut-off events. [2024-11-13 16:03:59,093 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-13 16:03:59,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 866 events. 48/866 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3725 event pairs, 20 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 859. Up to 51 conditions per place. [2024-11-13 16:03:59,120 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/606 dead transitions. [2024-11-13 16:03:59,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 606 transitions, 1254 flow [2024-11-13 16:03:59,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:03:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:03:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2024-11-13 16:03:59,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9582697201017811 [2024-11-13 16:03:59,127 INFO L175 Difference]: Start difference. First operand has 595 places, 607 transitions, 1224 flow. Second operand 3 states and 1883 transitions. [2024-11-13 16:03:59,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 606 transitions, 1254 flow [2024-11-13 16:03:59,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 606 transitions, 1250 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:03:59,142 INFO L231 Difference]: Finished difference. Result has 594 places, 606 transitions, 1222 flow [2024-11-13 16:03:59,144 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1222, PETRI_PLACES=594, PETRI_TRANSITIONS=606} [2024-11-13 16:03:59,148 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -17 predicate places. [2024-11-13 16:03:59,148 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 606 transitions, 1222 flow [2024-11-13 16:03:59,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-13 16:03:59,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:03:59,150 INFO L204 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, 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, 1] [2024-11-13 16:03:59,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 16:03:59,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:03:59,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:03:59,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1209143459, now seen corresponding path program 1 times [2024-11-13 16:03:59,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:03:59,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730243305] [2024-11-13 16:03:59,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:03:59,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:03:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:59,242 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-13 16:03:59,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:03:59,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730243305] [2024-11-13 16:03:59,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730243305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:03:59,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:03:59,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:03:59,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476881851] [2024-11-13 16:03:59,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:03:59,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:03:59,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:03:59,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:03:59,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:03:59,286 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 655 [2024-11-13 16:03:59,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 606 transitions, 1222 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-13 16:03:59,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:03:59,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 655 [2024-11-13 16:03:59,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:03:59,938 INFO L124 PetriNetUnfolderBase]: 165/2324 cut-off events. [2024-11-13 16:03:59,938 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2024-11-13 16:03:59,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2512 conditions, 2324 events. 165/2324 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 17878 event pairs, 64 based on Foata normal form. 0/1904 useless extension candidates. Maximal degree in co-relation 2435. Up to 151 conditions per place. [2024-11-13 16:03:59,986 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 16 selfloop transitions, 1 changer transitions 0/601 dead transitions. [2024-11-13 16:03:59,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 601 transitions, 1246 flow [2024-11-13 16:03:59,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:03:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:03:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2024-11-13 16:03:59,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95470737913486 [2024-11-13 16:03:59,992 INFO L175 Difference]: Start difference. First operand has 594 places, 606 transitions, 1222 flow. Second operand 3 states and 1876 transitions. [2024-11-13 16:03:59,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 601 transitions, 1246 flow [2024-11-13 16:03:59,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 601 transitions, 1242 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:04:00,004 INFO L231 Difference]: Finished difference. Result has 589 places, 601 transitions, 1210 flow [2024-11-13 16:04:00,005 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1210, PETRI_PLACES=589, PETRI_TRANSITIONS=601} [2024-11-13 16:04:00,006 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-11-13 16:04:00,006 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 601 transitions, 1210 flow [2024-11-13 16:04:00,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-13 16:04:00,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:00,008 INFO L204 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, 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, 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-13 16:04:00,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 16:04:00,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:00,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:00,009 INFO L85 PathProgramCache]: Analyzing trace with hash 958055100, now seen corresponding path program 1 times [2024-11-13 16:04:00,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:00,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119391928] [2024-11-13 16:04:00,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:00,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:00,111 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-13 16:04:00,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:00,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119391928] [2024-11-13 16:04:00,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119391928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:00,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:00,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:00,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17171616] [2024-11-13 16:04:00,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:00,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:00,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:00,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:00,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:00,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-13 16:04:00,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 601 transitions, 1210 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-13 16:04:00,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:00,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-13 16:04:00,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:00,672 INFO L124 PetriNetUnfolderBase]: 88/1774 cut-off events. [2024-11-13 16:04:00,672 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-13 16:04:00,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1774 events. 88/1774 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10556 event pairs, 20 based on Foata normal form. 0/1446 useless extension candidates. Maximal degree in co-relation 1765. Up to 50 conditions per place. [2024-11-13 16:04:00,702 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/600 dead transitions. [2024-11-13 16:04:00,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 600 transitions, 1238 flow [2024-11-13 16:04:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-13 16:04:00,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-11-13 16:04:00,709 INFO L175 Difference]: Start difference. First operand has 589 places, 601 transitions, 1210 flow. Second operand 3 states and 1885 transitions. [2024-11-13 16:04:00,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 600 transitions, 1238 flow [2024-11-13 16:04:00,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 600 transitions, 1237 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:04:00,720 INFO L231 Difference]: Finished difference. Result has 589 places, 600 transitions, 1211 flow [2024-11-13 16:04:00,723 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1211, PETRI_PLACES=589, PETRI_TRANSITIONS=600} [2024-11-13 16:04:00,726 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-11-13 16:04:00,726 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 600 transitions, 1211 flow [2024-11-13 16:04:00,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-13 16:04:00,728 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:00,728 INFO L204 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, 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, 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-13 16:04:00,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 16:04:00,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:00,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash 953883551, now seen corresponding path program 1 times [2024-11-13 16:04:00,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:00,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269118115] [2024-11-13 16:04:00,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:00,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:01,828 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-13 16:04:01,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:01,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269118115] [2024-11-13 16:04:01,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269118115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:01,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:01,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:04:01,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244945030] [2024-11-13 16:04:01,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:01,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:04:01,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:01,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:04:01,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:04:02,677 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 655 [2024-11-13 16:04:02,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 600 transitions, 1211 flow. Second operand has 6 states, 6 states have (on average 545.5) internal successors, (3273), 6 states have internal predecessors, (3273), 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-13 16:04:02,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:02,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 655 [2024-11-13 16:04:02,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:15,573 INFO L124 PetriNetUnfolderBase]: 12845/49433 cut-off events. [2024-11-13 16:04:15,573 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-11-13 16:04:15,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66916 conditions, 49433 events. 12845/49433 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 651410 event pairs, 10080 based on Foata normal form. 0/41101 useless extension candidates. Maximal degree in co-relation 66840. Up to 17156 conditions per place. [2024-11-13 16:04:16,276 INFO L140 encePairwiseOnDemand]: 637/655 looper letters, 78 selfloop transitions, 15 changer transitions 0/597 dead transitions. [2024-11-13 16:04:16,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 597 transitions, 1391 flow [2024-11-13 16:04:16,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:04:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 16:04:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3360 transitions. [2024-11-13 16:04:16,288 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8549618320610687 [2024-11-13 16:04:16,288 INFO L175 Difference]: Start difference. First operand has 589 places, 600 transitions, 1211 flow. Second operand 6 states and 3360 transitions. [2024-11-13 16:04:16,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 597 transitions, 1391 flow [2024-11-13 16:04:16,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 597 transitions, 1387 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:04:16,303 INFO L231 Difference]: Finished difference. Result has 589 places, 597 transitions, 1231 flow [2024-11-13 16:04:16,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1231, PETRI_PLACES=589, PETRI_TRANSITIONS=597} [2024-11-13 16:04:16,306 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-11-13 16:04:16,307 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 597 transitions, 1231 flow [2024-11-13 16:04:16,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 545.5) internal successors, (3273), 6 states have internal predecessors, (3273), 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-13 16:04:16,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:16,309 INFO L204 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, 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, 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-13 16:04:16,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 16:04:16,310 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:16,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:16,311 INFO L85 PathProgramCache]: Analyzing trace with hash -698544595, now seen corresponding path program 1 times [2024-11-13 16:04:16,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:16,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612260920] [2024-11-13 16:04:16,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:16,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:16,422 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-13 16:04:16,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:16,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612260920] [2024-11-13 16:04:16,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612260920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:16,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:16,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:16,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000589686] [2024-11-13 16:04:16,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:16,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:16,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:16,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:16,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:16,470 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 655 [2024-11-13 16:04:16,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 597 transitions, 1231 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-13 16:04:16,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:16,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 655 [2024-11-13 16:04:16,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:17,175 INFO L124 PetriNetUnfolderBase]: 112/1698 cut-off events. [2024-11-13 16:04:17,176 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2024-11-13 16:04:17,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1830 conditions, 1698 events. 112/1698 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11036 event pairs, 32 based on Foata normal form. 0/1418 useless extension candidates. Maximal degree in co-relation 1782. Up to 101 conditions per place. [2024-11-13 16:04:17,228 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 16 selfloop transitions, 1 changer transitions 0/592 dead transitions. [2024-11-13 16:04:17,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 592 transitions, 1255 flow [2024-11-13 16:04:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2024-11-13 16:04:17,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95470737913486 [2024-11-13 16:04:17,238 INFO L175 Difference]: Start difference. First operand has 589 places, 597 transitions, 1231 flow. Second operand 3 states and 1876 transitions. [2024-11-13 16:04:17,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 592 transitions, 1255 flow [2024-11-13 16:04:17,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 592 transitions, 1225 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-13 16:04:17,255 INFO L231 Difference]: Finished difference. Result has 581 places, 592 transitions, 1193 flow [2024-11-13 16:04:17,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1193, PETRI_PLACES=581, PETRI_TRANSITIONS=592} [2024-11-13 16:04:17,258 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -30 predicate places. [2024-11-13 16:04:17,258 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 592 transitions, 1193 flow [2024-11-13 16:04:17,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-13 16:04:17,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:17,260 INFO L204 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, 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, 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, 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-13 16:04:17,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 16:04:17,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:17,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:17,261 INFO L85 PathProgramCache]: Analyzing trace with hash 175342027, now seen corresponding path program 1 times [2024-11-13 16:04:17,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:17,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609394106] [2024-11-13 16:04:17,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:17,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:17,374 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-13 16:04:17,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:17,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609394106] [2024-11-13 16:04:17,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609394106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:17,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:17,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029493292] [2024-11-13 16:04:17,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:17,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:17,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:17,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:17,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:17,420 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-13 16:04:17,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 592 transitions, 1193 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-13 16:04:17,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:17,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-13 16:04:17,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:17,800 INFO L124 PetriNetUnfolderBase]: 50/1065 cut-off events. [2024-11-13 16:04:17,800 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-13 16:04:17,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1065 events. 50/1065 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4845 event pairs, 12 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1039. Up to 38 conditions per place. [2024-11-13 16:04:17,823 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/591 dead transitions. [2024-11-13 16:04:17,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 591 transitions, 1221 flow [2024-11-13 16:04:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-13 16:04:17,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-11-13 16:04:17,831 INFO L175 Difference]: Start difference. First operand has 581 places, 592 transitions, 1193 flow. Second operand 3 states and 1885 transitions. [2024-11-13 16:04:17,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 591 transitions, 1221 flow [2024-11-13 16:04:17,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 591 transitions, 1220 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:04:17,846 INFO L231 Difference]: Finished difference. Result has 581 places, 591 transitions, 1194 flow [2024-11-13 16:04:17,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1194, PETRI_PLACES=581, PETRI_TRANSITIONS=591} [2024-11-13 16:04:17,848 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -30 predicate places. [2024-11-13 16:04:17,848 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 591 transitions, 1194 flow [2024-11-13 16:04:17,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-13 16:04:17,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:17,850 INFO L204 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, 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, 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, 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-13 16:04:17,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 16:04:17,850 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:17,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:17,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1069801515, now seen corresponding path program 1 times [2024-11-13 16:04:17,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:17,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37667735] [2024-11-13 16:04:17,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:17,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:17,963 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-13 16:04:17,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:17,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37667735] [2024-11-13 16:04:17,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37667735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:17,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:17,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:17,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266717615] [2024-11-13 16:04:17,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:17,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:17,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:17,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:17,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:18,001 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 655 [2024-11-13 16:04:18,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 591 transitions, 1194 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-13 16:04:18,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:18,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 655 [2024-11-13 16:04:18,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:18,649 INFO L124 PetriNetUnfolderBase]: 173/2005 cut-off events. [2024-11-13 16:04:18,649 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2024-11-13 16:04:18,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2190 conditions, 2005 events. 173/2005 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 13680 event pairs, 64 based on Foata normal form. 0/1696 useless extension candidates. Maximal degree in co-relation 2113. Up to 170 conditions per place. [2024-11-13 16:04:18,697 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 16 selfloop transitions, 1 changer transitions 0/586 dead transitions. [2024-11-13 16:04:18,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 586 transitions, 1218 flow [2024-11-13 16:04:18,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2024-11-13 16:04:18,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95470737913486 [2024-11-13 16:04:18,703 INFO L175 Difference]: Start difference. First operand has 581 places, 591 transitions, 1194 flow. Second operand 3 states and 1876 transitions. [2024-11-13 16:04:18,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 586 transitions, 1218 flow [2024-11-13 16:04:18,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 586 transitions, 1214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:04:18,713 INFO L231 Difference]: Finished difference. Result has 576 places, 586 transitions, 1182 flow [2024-11-13 16:04:18,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1182, PETRI_PLACES=576, PETRI_TRANSITIONS=586} [2024-11-13 16:04:18,716 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -35 predicate places. [2024-11-13 16:04:18,716 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 586 transitions, 1182 flow [2024-11-13 16:04:18,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-13 16:04:18,718 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:18,718 INFO L204 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, 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, 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, 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, 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-13 16:04:18,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 16:04:18,718 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:18,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1060387401, now seen corresponding path program 1 times [2024-11-13 16:04:18,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:18,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068977948] [2024-11-13 16:04:18,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:18,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:18,828 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-13 16:04:18,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:18,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068977948] [2024-11-13 16:04:18,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068977948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:18,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:18,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:18,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805059178] [2024-11-13 16:04:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:18,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:18,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:18,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:18,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:18,880 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-13 16:04:18,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 586 transitions, 1182 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-13 16:04:18,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:18,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-13 16:04:18,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:19,113 INFO L124 PetriNetUnfolderBase]: 48/837 cut-off events. [2024-11-13 16:04:19,114 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-13 16:04:19,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 837 events. 48/837 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3228 event pairs, 20 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 822. Up to 50 conditions per place. [2024-11-13 16:04:19,132 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-11-13 16:04:19,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 585 transitions, 1210 flow [2024-11-13 16:04:19,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-13 16:04:19,138 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-11-13 16:04:19,139 INFO L175 Difference]: Start difference. First operand has 576 places, 586 transitions, 1182 flow. Second operand 3 states and 1885 transitions. [2024-11-13 16:04:19,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 585 transitions, 1210 flow [2024-11-13 16:04:19,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 585 transitions, 1209 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:04:19,150 INFO L231 Difference]: Finished difference. Result has 576 places, 585 transitions, 1183 flow [2024-11-13 16:04:19,151 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=576, PETRI_TRANSITIONS=585} [2024-11-13 16:04:19,153 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -35 predicate places. [2024-11-13 16:04:19,154 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 585 transitions, 1183 flow [2024-11-13 16:04:19,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-13 16:04:19,156 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:19,156 INFO L204 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, 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, 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, 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, 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, 1] [2024-11-13 16:04:19,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 16:04:19,156 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:19,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:19,157 INFO L85 PathProgramCache]: Analyzing trace with hash -439338274, now seen corresponding path program 1 times [2024-11-13 16:04:19,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:19,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671938483] [2024-11-13 16:04:19,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:19,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:19,262 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-13 16:04:19,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:19,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671938483] [2024-11-13 16:04:19,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671938483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:19,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:19,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:19,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211367071] [2024-11-13 16:04:19,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:19,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:19,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:19,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:19,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:19,294 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-13 16:04:19,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 585 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-13 16:04:19,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:19,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-13 16:04:19,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:19,887 INFO L124 PetriNetUnfolderBase]: 157/2220 cut-off events. [2024-11-13 16:04:19,887 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-13 16:04:19,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 2220 events. 157/2220 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 16990 event pairs, 53 based on Foata normal form. 0/1869 useless extension candidates. Maximal degree in co-relation 2309. Up to 123 conditions per place. [2024-11-13 16:04:19,935 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 17 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-11-13 16:04:19,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 585 transitions, 1223 flow [2024-11-13 16:04:19,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2024-11-13 16:04:19,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597964376590331 [2024-11-13 16:04:19,943 INFO L175 Difference]: Start difference. First operand has 576 places, 585 transitions, 1183 flow. Second operand 3 states and 1886 transitions. [2024-11-13 16:04:19,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 585 transitions, 1223 flow [2024-11-13 16:04:19,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 585 transitions, 1219 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:04:19,963 INFO L231 Difference]: Finished difference. Result has 573 places, 583 transitions, 1185 flow [2024-11-13 16:04:19,965 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1185, PETRI_PLACES=573, PETRI_TRANSITIONS=583} [2024-11-13 16:04:19,966 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -38 predicate places. [2024-11-13 16:04:19,967 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 583 transitions, 1185 flow [2024-11-13 16:04:19,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-13 16:04:19,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:19,969 INFO L204 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, 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, 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, 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, 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, 1, 1, 1] [2024-11-13 16:04:19,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 16:04:19,969 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:19,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:19,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1297239136, now seen corresponding path program 1 times [2024-11-13 16:04:19,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:19,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681642867] [2024-11-13 16:04:19,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:19,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:20,108 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-13 16:04:20,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:20,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681642867] [2024-11-13 16:04:20,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681642867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:20,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:20,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:20,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14796148] [2024-11-13 16:04:20,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:20,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:20,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:20,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:20,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:20,145 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-13 16:04:20,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 583 transitions, 1185 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-13 16:04:20,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:20,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-13 16:04:20,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:20,773 INFO L124 PetriNetUnfolderBase]: 96/1534 cut-off events. [2024-11-13 16:04:20,774 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-13 16:04:20,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 1534 events. 96/1534 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9632 event pairs, 20 based on Foata normal form. 0/1315 useless extension candidates. Maximal degree in co-relation 1559. Up to 75 conditions per place. [2024-11-13 16:04:20,815 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 17 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2024-11-13 16:04:20,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 583 transitions, 1225 flow [2024-11-13 16:04:20,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2024-11-13 16:04:20,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597964376590331 [2024-11-13 16:04:20,822 INFO L175 Difference]: Start difference. First operand has 573 places, 583 transitions, 1185 flow. Second operand 3 states and 1886 transitions. [2024-11-13 16:04:20,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 583 transitions, 1225 flow [2024-11-13 16:04:20,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 583 transitions, 1225 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 16:04:20,839 INFO L231 Difference]: Finished difference. Result has 572 places, 581 transitions, 1191 flow [2024-11-13 16:04:20,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=572, PETRI_TRANSITIONS=581} [2024-11-13 16:04:20,842 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2024-11-13 16:04:20,842 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 581 transitions, 1191 flow [2024-11-13 16:04:20,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-13 16:04:20,844 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:20,844 INFO L204 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:20,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 16:04:20,845 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:20,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1039525323, now seen corresponding path program 1 times [2024-11-13 16:04:20,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:20,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032368543] [2024-11-13 16:04:20,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:20,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:20,973 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-13 16:04:20,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:20,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032368543] [2024-11-13 16:04:20,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032368543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:20,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:20,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:20,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843358235] [2024-11-13 16:04:20,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:20,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:20,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:20,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:20,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:21,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-13 16:04:21,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 581 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-13 16:04:21,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:21,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-13 16:04:21,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:21,738 INFO L124 PetriNetUnfolderBase]: 209/2521 cut-off events. [2024-11-13 16:04:21,738 INFO L125 PetriNetUnfolderBase]: For 28/32 co-relation queries the response was YES. [2024-11-13 16:04:21,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2777 conditions, 2521 events. 209/2521 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 20284 event pairs, 77 based on Foata normal form. 1/2177 useless extension candidates. Maximal degree in co-relation 2699. Up to 203 conditions per place. [2024-11-13 16:04:21,770 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 17 selfloop transitions, 2 changer transitions 0/581 dead transitions. [2024-11-13 16:04:21,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 581 transitions, 1231 flow [2024-11-13 16:04:21,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2024-11-13 16:04:21,778 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597964376590331 [2024-11-13 16:04:21,778 INFO L175 Difference]: Start difference. First operand has 572 places, 581 transitions, 1191 flow. Second operand 3 states and 1886 transitions. [2024-11-13 16:04:21,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 581 transitions, 1231 flow [2024-11-13 16:04:21,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 581 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 16:04:21,793 INFO L231 Difference]: Finished difference. Result has 571 places, 579 transitions, 1197 flow [2024-11-13 16:04:21,794 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1197, PETRI_PLACES=571, PETRI_TRANSITIONS=579} [2024-11-13 16:04:21,795 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2024-11-13 16:04:21,795 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 579 transitions, 1197 flow [2024-11-13 16:04:21,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-13 16:04:21,798 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:21,798 INFO L204 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:21,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 16:04:21,799 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:21,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2140149788, now seen corresponding path program 1 times [2024-11-13 16:04:21,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:21,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920793730] [2024-11-13 16:04:21,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:21,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:21,950 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-13 16:04:21,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:21,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920793730] [2024-11-13 16:04:21,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920793730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:21,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:21,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:21,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577171245] [2024-11-13 16:04:21,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:21,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:21,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:21,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:21,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:21,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-13 16:04:21,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 579 transitions, 1197 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-13 16:04:21,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:21,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-13 16:04:21,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:22,704 INFO L124 PetriNetUnfolderBase]: 108/2057 cut-off events. [2024-11-13 16:04:22,704 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2024-11-13 16:04:22,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 2057 events. 108/2057 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13463 event pairs, 8 based on Foata normal form. 1/1771 useless extension candidates. Maximal degree in co-relation 2089. Up to 33 conditions per place. [2024-11-13 16:04:22,734 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2024-11-13 16:04:22,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 580 transitions, 1231 flow [2024-11-13 16:04:22,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2024-11-13 16:04:22,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9638676844783715 [2024-11-13 16:04:22,740 INFO L175 Difference]: Start difference. First operand has 571 places, 579 transitions, 1197 flow. Second operand 3 states and 1894 transitions. [2024-11-13 16:04:22,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 580 transitions, 1231 flow [2024-11-13 16:04:22,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 580 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 16:04:22,755 INFO L231 Difference]: Finished difference. Result has 572 places, 578 transitions, 1199 flow [2024-11-13 16:04:22,756 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=572, PETRI_TRANSITIONS=578} [2024-11-13 16:04:22,756 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2024-11-13 16:04:22,757 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 578 transitions, 1199 flow [2024-11-13 16:04:22,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-13 16:04:22,762 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:22,762 INFO L204 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:22,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 16:04:22,763 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:22,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:22,763 INFO L85 PathProgramCache]: Analyzing trace with hash -507233512, now seen corresponding path program 1 times [2024-11-13 16:04:22,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:22,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882624549] [2024-11-13 16:04:22,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:22,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:22,903 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-13 16:04:22,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:22,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882624549] [2024-11-13 16:04:22,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882624549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:22,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:22,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:04:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756239762] [2024-11-13 16:04:22,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:22,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:22,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:22,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:22,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:22,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-13 16:04:22,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 578 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-13 16:04:22,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:22,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-13 16:04:22,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:23,461 INFO L124 PetriNetUnfolderBase]: 89/1589 cut-off events. [2024-11-13 16:04:23,461 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-13 16:04:23,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 1589 events. 89/1589 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10246 event pairs, 12 based on Foata normal form. 0/1372 useless extension candidates. Maximal degree in co-relation 1664. Up to 40 conditions per place. [2024-11-13 16:04:23,481 INFO L140 encePairwiseOnDemand]: 651/655 looper letters, 14 selfloop transitions, 3 changer transitions 0/581 dead transitions. [2024-11-13 16:04:23,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 581 transitions, 1241 flow [2024-11-13 16:04:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-11-13 16:04:23,485 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-11-13 16:04:23,485 INFO L175 Difference]: Start difference. First operand has 572 places, 578 transitions, 1199 flow. Second operand 3 states and 1896 transitions. [2024-11-13 16:04:23,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 581 transitions, 1241 flow [2024-11-13 16:04:23,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 581 transitions, 1237 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:04:23,499 INFO L231 Difference]: Finished difference. Result has 574 places, 579 transitions, 1213 flow [2024-11-13 16:04:23,500 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=574, PETRI_TRANSITIONS=579} [2024-11-13 16:04:23,501 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -37 predicate places. [2024-11-13 16:04:23,501 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 579 transitions, 1213 flow [2024-11-13 16:04:23,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-13 16:04:23,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:23,504 INFO L204 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:23,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 16:04:23,504 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:23,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash -578617949, now seen corresponding path program 1 times [2024-11-13 16:04:23,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:23,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385978896] [2024-11-13 16:04:23,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:23,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:23,640 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-13 16:04:23,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:23,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385978896] [2024-11-13 16:04:23,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385978896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:23,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:23,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:23,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301296516] [2024-11-13 16:04:23,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:23,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:23,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:23,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:23,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:23,676 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-13 16:04:23,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 579 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-13 16:04:23,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:23,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-13 16:04:23,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:24,622 INFO L124 PetriNetUnfolderBase]: 197/2613 cut-off events. [2024-11-13 16:04:24,622 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2024-11-13 16:04:24,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 2613 events. 197/2613 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 19830 event pairs, 24 based on Foata normal form. 0/2267 useless extension candidates. Maximal degree in co-relation 2827. Up to 168 conditions per place. [2024-11-13 16:04:24,669 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 20 selfloop transitions, 2 changer transitions 0/582 dead transitions. [2024-11-13 16:04:24,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 582 transitions, 1268 flow [2024-11-13 16:04:24,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:24,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-11-13 16:04:24,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-11-13 16:04:24,674 INFO L175 Difference]: Start difference. First operand has 574 places, 579 transitions, 1213 flow. Second operand 3 states and 1889 transitions. [2024-11-13 16:04:24,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 582 transitions, 1268 flow [2024-11-13 16:04:24,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 582 transitions, 1262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:04:24,693 INFO L231 Difference]: Finished difference. Result has 571 places, 577 transitions, 1213 flow [2024-11-13 16:04:24,694 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=571, PETRI_TRANSITIONS=577} [2024-11-13 16:04:24,694 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2024-11-13 16:04:24,694 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 577 transitions, 1213 flow [2024-11-13 16:04:24,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-13 16:04:24,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:24,696 INFO L204 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:24,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 16:04:24,696 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:24,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:24,697 INFO L85 PathProgramCache]: Analyzing trace with hash -687845096, now seen corresponding path program 1 times [2024-11-13 16:04:24,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:24,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388958204] [2024-11-13 16:04:24,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:24,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:24,820 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-13 16:04:24,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:24,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388958204] [2024-11-13 16:04:24,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388958204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:24,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:24,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:24,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455864079] [2024-11-13 16:04:24,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:24,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:24,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:24,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:24,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:24,867 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-13 16:04:24,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 577 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-13 16:04:24,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:24,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-13 16:04:24,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:25,715 INFO L124 PetriNetUnfolderBase]: 169/2812 cut-off events. [2024-11-13 16:04:25,715 INFO L125 PetriNetUnfolderBase]: For 20/59 co-relation queries the response was YES. [2024-11-13 16:04:25,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 2812 events. 169/2812 cut-off events. For 20/59 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 20846 event pairs, 19 based on Foata normal form. 0/2415 useless extension candidates. Maximal degree in co-relation 2941. Up to 72 conditions per place. [2024-11-13 16:04:25,757 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/578 dead transitions. [2024-11-13 16:04:25,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 578 transitions, 1249 flow [2024-11-13 16:04:25,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-13 16:04:25,761 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-11-13 16:04:25,762 INFO L175 Difference]: Start difference. First operand has 571 places, 577 transitions, 1213 flow. Second operand 3 states and 1892 transitions. [2024-11-13 16:04:25,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 578 transitions, 1249 flow [2024-11-13 16:04:25,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 578 transitions, 1249 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 16:04:25,771 INFO L231 Difference]: Finished difference. Result has 572 places, 576 transitions, 1215 flow [2024-11-13 16:04:25,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1215, PETRI_PLACES=572, PETRI_TRANSITIONS=576} [2024-11-13 16:04:25,772 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2024-11-13 16:04:25,772 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 576 transitions, 1215 flow [2024-11-13 16:04:25,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-13 16:04:25,773 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:25,773 INFO L204 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:25,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 16:04:25,774 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:25,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:25,774 INFO L85 PathProgramCache]: Analyzing trace with hash -379846005, now seen corresponding path program 1 times [2024-11-13 16:04:25,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:25,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124121457] [2024-11-13 16:04:25,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:25,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:25,879 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-13 16:04:25,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:25,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124121457] [2024-11-13 16:04:25,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124121457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:25,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:25,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:25,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191444910] [2024-11-13 16:04:25,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:25,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:25,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:25,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:25,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:25,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-13 16:04:25,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 576 transitions, 1215 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-13 16:04:25,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:25,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-13 16:04:25,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:26,923 INFO L124 PetriNetUnfolderBase]: 147/2543 cut-off events. [2024-11-13 16:04:26,923 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2024-11-13 16:04:26,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 2543 events. 147/2543 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 18047 event pairs, 10 based on Foata normal form. 0/2202 useless extension candidates. Maximal degree in co-relation 2661. Up to 44 conditions per place. [2024-11-13 16:04:26,963 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2024-11-13 16:04:26,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 577 transitions, 1249 flow [2024-11-13 16:04:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2024-11-13 16:04:26,969 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9638676844783715 [2024-11-13 16:04:26,969 INFO L175 Difference]: Start difference. First operand has 572 places, 576 transitions, 1215 flow. Second operand 3 states and 1894 transitions. [2024-11-13 16:04:26,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 577 transitions, 1249 flow [2024-11-13 16:04:26,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 577 transitions, 1245 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:04:26,983 INFO L231 Difference]: Finished difference. Result has 571 places, 575 transitions, 1213 flow [2024-11-13 16:04:26,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=571, PETRI_TRANSITIONS=575} [2024-11-13 16:04:26,985 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2024-11-13 16:04:26,985 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 575 transitions, 1213 flow [2024-11-13 16:04:26,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-13 16:04:26,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:26,987 INFO L204 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:26,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 16:04:26,987 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:26,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:26,988 INFO L85 PathProgramCache]: Analyzing trace with hash -389186903, now seen corresponding path program 1 times [2024-11-13 16:04:26,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:26,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198841660] [2024-11-13 16:04:26,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:26,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:27,485 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-13 16:04:27,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:27,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198841660] [2024-11-13 16:04:27,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198841660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:27,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:27,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:04:27,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277616320] [2024-11-13 16:04:27,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:27,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:04:27,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:27,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:04:27,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:04:28,559 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-13 16:04:28,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 575 transitions, 1213 flow. Second operand has 8 states, 8 states have (on average 598.125) internal successors, (4785), 8 states have internal predecessors, (4785), 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-13 16:04:28,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:28,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-13 16:04:28,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:29,924 INFO L124 PetriNetUnfolderBase]: 235/3653 cut-off events. [2024-11-13 16:04:29,924 INFO L125 PetriNetUnfolderBase]: For 9/27 co-relation queries the response was YES. [2024-11-13 16:04:29,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4125 conditions, 3653 events. 235/3653 cut-off events. For 9/27 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 31367 event pairs, 43 based on Foata normal form. 5/3193 useless extension candidates. Maximal degree in co-relation 4072. Up to 155 conditions per place. [2024-11-13 16:04:29,984 INFO L140 encePairwiseOnDemand]: 640/655 looper letters, 70 selfloop transitions, 16 changer transitions 0/614 dead transitions. [2024-11-13 16:04:29,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 614 transitions, 1479 flow [2024-11-13 16:04:29,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 16:04:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-13 16:04:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6620 transitions. [2024-11-13 16:04:29,994 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9188063844552394 [2024-11-13 16:04:29,995 INFO L175 Difference]: Start difference. First operand has 571 places, 575 transitions, 1213 flow. Second operand 11 states and 6620 transitions. [2024-11-13 16:04:29,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 614 transitions, 1479 flow [2024-11-13 16:04:29,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 614 transitions, 1475 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:04:30,006 INFO L231 Difference]: Finished difference. Result has 584 places, 584 transitions, 1293 flow [2024-11-13 16:04:30,007 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1293, PETRI_PLACES=584, PETRI_TRANSITIONS=584} [2024-11-13 16:04:30,007 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2024-11-13 16:04:30,007 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 584 transitions, 1293 flow [2024-11-13 16:04:30,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.125) internal successors, (4785), 8 states have internal predecessors, (4785), 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-13 16:04:30,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:30,009 INFO L204 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, 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, 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, 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, 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, 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-13 16:04:30,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 16:04:30,009 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:30,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:30,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1560841791, now seen corresponding path program 1 times [2024-11-13 16:04:30,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:30,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671928967] [2024-11-13 16:04:30,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:30,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:30,117 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-13 16:04:30,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:30,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671928967] [2024-11-13 16:04:30,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671928967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:30,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:30,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:30,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594855064] [2024-11-13 16:04:30,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:30,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:30,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:30,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:30,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:30,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-13 16:04:30,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 584 transitions, 1293 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-13 16:04:30,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:30,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-13 16:04:30,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:30,861 INFO L124 PetriNetUnfolderBase]: 188/2425 cut-off events. [2024-11-13 16:04:30,861 INFO L125 PetriNetUnfolderBase]: For 72/129 co-relation queries the response was YES. [2024-11-13 16:04:30,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 2425 events. 188/2425 cut-off events. For 72/129 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 18612 event pairs, 37 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 2718. Up to 162 conditions per place. [2024-11-13 16:04:30,903 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-11-13 16:04:30,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 585 transitions, 1329 flow [2024-11-13 16:04:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-13 16:04:30,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-11-13 16:04:30,908 INFO L175 Difference]: Start difference. First operand has 584 places, 584 transitions, 1293 flow. Second operand 3 states and 1892 transitions. [2024-11-13 16:04:30,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 585 transitions, 1329 flow [2024-11-13 16:04:30,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 585 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:04:30,917 INFO L231 Difference]: Finished difference. Result has 584 places, 583 transitions, 1291 flow [2024-11-13 16:04:30,918 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1291, PETRI_PLACES=584, PETRI_TRANSITIONS=583} [2024-11-13 16:04:30,918 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2024-11-13 16:04:30,918 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 583 transitions, 1291 flow [2024-11-13 16:04:30,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-13 16:04:30,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:30,919 INFO L204 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, 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, 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, 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, 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, 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-13 16:04:30,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 16:04:30,920 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:30,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:30,921 INFO L85 PathProgramCache]: Analyzing trace with hash 277887475, now seen corresponding path program 1 times [2024-11-13 16:04:30,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:30,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440877296] [2024-11-13 16:04:30,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:30,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:31,022 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-13 16:04:31,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:31,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440877296] [2024-11-13 16:04:31,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440877296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:31,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:31,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:04:31,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055576305] [2024-11-13 16:04:31,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:31,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:31,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:31,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:31,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:31,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-13 16:04:31,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 583 transitions, 1291 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-13 16:04:31,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:31,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-13 16:04:31,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:32,143 INFO L124 PetriNetUnfolderBase]: 299/3755 cut-off events. [2024-11-13 16:04:32,143 INFO L125 PetriNetUnfolderBase]: For 60/93 co-relation queries the response was YES. [2024-11-13 16:04:32,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4365 conditions, 3755 events. 299/3755 cut-off events. For 60/93 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 33204 event pairs, 72 based on Foata normal form. 0/3270 useless extension candidates. Maximal degree in co-relation 4277. Up to 227 conditions per place. [2024-11-13 16:04:32,209 INFO L140 encePairwiseOnDemand]: 651/655 looper letters, 14 selfloop transitions, 3 changer transitions 0/586 dead transitions. [2024-11-13 16:04:32,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 586 transitions, 1333 flow [2024-11-13 16:04:32,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-11-13 16:04:32,214 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-11-13 16:04:32,214 INFO L175 Difference]: Start difference. First operand has 584 places, 583 transitions, 1291 flow. Second operand 3 states and 1896 transitions. [2024-11-13 16:04:32,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 586 transitions, 1333 flow [2024-11-13 16:04:32,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 586 transitions, 1329 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:04:32,225 INFO L231 Difference]: Finished difference. Result has 586 places, 584 transitions, 1305 flow [2024-11-13 16:04:32,225 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=586, PETRI_TRANSITIONS=584} [2024-11-13 16:04:32,226 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -25 predicate places. [2024-11-13 16:04:32,226 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 584 transitions, 1305 flow [2024-11-13 16:04:32,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-13 16:04:32,227 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:32,227 INFO L204 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, 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, 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, 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, 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, 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-13 16:04:32,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 16:04:32,227 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:32,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:32,228 INFO L85 PathProgramCache]: Analyzing trace with hash 726144757, now seen corresponding path program 1 times [2024-11-13 16:04:32,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:32,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514604745] [2024-11-13 16:04:32,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:32,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:32,334 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-13 16:04:32,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:32,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514604745] [2024-11-13 16:04:32,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514604745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:32,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:32,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:04:32,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648265587] [2024-11-13 16:04:32,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:32,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:32,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:32,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:32,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-13 16:04:32,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 584 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-13 16:04:32,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:32,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-13 16:04:32,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:33,352 INFO L124 PetriNetUnfolderBase]: 252/3105 cut-off events. [2024-11-13 16:04:33,352 INFO L125 PetriNetUnfolderBase]: For 129/226 co-relation queries the response was YES. [2024-11-13 16:04:33,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3645 conditions, 3105 events. 252/3105 cut-off events. For 129/226 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 24545 event pairs, 66 based on Foata normal form. 0/2693 useless extension candidates. Maximal degree in co-relation 3556. Up to 236 conditions per place. [2024-11-13 16:04:33,392 INFO L140 encePairwiseOnDemand]: 651/655 looper letters, 14 selfloop transitions, 3 changer transitions 0/587 dead transitions. [2024-11-13 16:04:33,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 587 transitions, 1347 flow [2024-11-13 16:04:33,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-11-13 16:04:33,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-11-13 16:04:33,394 INFO L175 Difference]: Start difference. First operand has 586 places, 584 transitions, 1305 flow. Second operand 3 states and 1896 transitions. [2024-11-13 16:04:33,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 587 transitions, 1347 flow [2024-11-13 16:04:33,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 587 transitions, 1341 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:04:33,403 INFO L231 Difference]: Finished difference. Result has 588 places, 585 transitions, 1317 flow [2024-11-13 16:04:33,404 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=588, PETRI_TRANSITIONS=585} [2024-11-13 16:04:33,404 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -23 predicate places. [2024-11-13 16:04:33,404 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 585 transitions, 1317 flow [2024-11-13 16:04:33,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-13 16:04:33,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:33,405 INFO L204 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, 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, 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, 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, 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, 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-13 16:04:33,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 16:04:33,405 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:33,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:33,406 INFO L85 PathProgramCache]: Analyzing trace with hash -428790528, now seen corresponding path program 1 times [2024-11-13 16:04:33,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:33,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995387716] [2024-11-13 16:04:33,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:33,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:33,481 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-13 16:04:33,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:33,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995387716] [2024-11-13 16:04:33,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995387716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:33,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:33,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:33,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794590038] [2024-11-13 16:04:33,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:33,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:33,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:33,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:33,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:33,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-13 16:04:33,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 585 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-13 16:04:33,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:33,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-13 16:04:33,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:34,712 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1785] thread2EXIT-->L124: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][468], [572#L124true, 673#(= |#race~n3~0| 0), Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), 687#(= |#race~count3~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), 655#(= |#race~n1~0| 0), Black: 677#true, 740#true, Black: 681#true, 745#true, 683#(= |#race~count2~0| 0), Black: 685#true, 526#$Ultimate##0true, 679#(= |#race~count1~0| 0), 667#(= |#race~n2~0| 0), Black: 712#(<= ~n1~0 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#true]) [2024-11-13 16:04:34,712 INFO L294 olderBase$Statistics]: this new event has 284 ancestors and is cut-off event [2024-11-13 16:04:34,713 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-13 16:04:34,713 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-11-13 16:04:34,713 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-13 16:04:34,879 INFO L124 PetriNetUnfolderBase]: 307/4941 cut-off events. [2024-11-13 16:04:34,879 INFO L125 PetriNetUnfolderBase]: For 112/177 co-relation queries the response was YES. [2024-11-13 16:04:34,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5708 conditions, 4941 events. 307/4941 cut-off events. For 112/177 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 44066 event pairs, 29 based on Foata normal form. 0/4369 useless extension candidates. Maximal degree in co-relation 5618. Up to 131 conditions per place. [2024-11-13 16:04:34,960 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/586 dead transitions. [2024-11-13 16:04:34,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 586 transitions, 1353 flow [2024-11-13 16:04:34,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:34,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-13 16:04:34,964 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-11-13 16:04:34,964 INFO L175 Difference]: Start difference. First operand has 588 places, 585 transitions, 1317 flow. Second operand 3 states and 1892 transitions. [2024-11-13 16:04:34,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 586 transitions, 1353 flow [2024-11-13 16:04:34,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 586 transitions, 1347 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:04:34,979 INFO L231 Difference]: Finished difference. Result has 587 places, 584 transitions, 1313 flow [2024-11-13 16:04:34,980 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1313, PETRI_PLACES=587, PETRI_TRANSITIONS=584} [2024-11-13 16:04:34,980 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -24 predicate places. [2024-11-13 16:04:34,980 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 584 transitions, 1313 flow [2024-11-13 16:04:34,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-13 16:04:34,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:34,982 INFO L204 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, 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, 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, 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, 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, 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-13 16:04:34,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 16:04:34,982 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:34,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:34,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1906467003, now seen corresponding path program 1 times [2024-11-13 16:04:34,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:34,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675975733] [2024-11-13 16:04:34,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:34,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:35,281 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-13 16:04:35,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:35,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675975733] [2024-11-13 16:04:35,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675975733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:35,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:35,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:04:35,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291892956] [2024-11-13 16:04:35,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:35,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:04:35,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:35,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:04:35,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:04:36,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-13 16:04:36,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 584 transitions, 1313 flow. Second operand has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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-13 16:04:36,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:36,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-13 16:04:36,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:37,135 INFO L124 PetriNetUnfolderBase]: 281/3552 cut-off events. [2024-11-13 16:04:37,135 INFO L125 PetriNetUnfolderBase]: For 68/132 co-relation queries the response was YES. [2024-11-13 16:04:37,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4330 conditions, 3552 events. 281/3552 cut-off events. For 68/132 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 30689 event pairs, 60 based on Foata normal form. 6/3159 useless extension candidates. Maximal degree in co-relation 4245. Up to 201 conditions per place. [2024-11-13 16:04:37,189 INFO L140 encePairwiseOnDemand]: 638/655 looper letters, 69 selfloop transitions, 19 changer transitions 0/620 dead transitions. [2024-11-13 16:04:37,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 620 transitions, 1579 flow [2024-11-13 16:04:37,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:04:37,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-13 16:04:37,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7217 transitions. [2024-11-13 16:04:37,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9181933842239186 [2024-11-13 16:04:37,198 INFO L175 Difference]: Start difference. First operand has 587 places, 584 transitions, 1313 flow. Second operand 12 states and 7217 transitions. [2024-11-13 16:04:37,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 620 transitions, 1579 flow [2024-11-13 16:04:37,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 620 transitions, 1575 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:04:37,210 INFO L231 Difference]: Finished difference. Result has 600 places, 589 transitions, 1389 flow [2024-11-13 16:04:37,211 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1389, PETRI_PLACES=600, PETRI_TRANSITIONS=589} [2024-11-13 16:04:37,211 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -11 predicate places. [2024-11-13 16:04:37,211 INFO L471 AbstractCegarLoop]: Abstraction has has 600 places, 589 transitions, 1389 flow [2024-11-13 16:04:37,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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-13 16:04:37,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:37,214 INFO L204 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, 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, 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, 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, 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, 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-13 16:04:37,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 16:04:37,214 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:37,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:37,214 INFO L85 PathProgramCache]: Analyzing trace with hash -451599032, now seen corresponding path program 1 times [2024-11-13 16:04:37,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:37,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355525644] [2024-11-13 16:04:37,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:37,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:37,284 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-13 16:04:37,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:37,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355525644] [2024-11-13 16:04:37,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355525644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:37,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:37,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:37,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933185318] [2024-11-13 16:04:37,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:37,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:37,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:37,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:37,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:37,311 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-13 16:04:37,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 589 transitions, 1389 flow. Second operand has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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-13 16:04:37,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:37,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-13 16:04:37,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:38,505 INFO L124 PetriNetUnfolderBase]: 312/4434 cut-off events. [2024-11-13 16:04:38,505 INFO L125 PetriNetUnfolderBase]: For 102/132 co-relation queries the response was YES. [2024-11-13 16:04:38,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5285 conditions, 4434 events. 312/4434 cut-off events. For 102/132 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 36779 event pairs, 36 based on Foata normal form. 1/3966 useless extension candidates. Maximal degree in co-relation 5188. Up to 250 conditions per place. [2024-11-13 16:04:38,571 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 20 selfloop transitions, 2 changer transitions 0/592 dead transitions. [2024-11-13 16:04:38,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 592 transitions, 1444 flow [2024-11-13 16:04:38,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-11-13 16:04:38,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-11-13 16:04:38,575 INFO L175 Difference]: Start difference. First operand has 600 places, 589 transitions, 1389 flow. Second operand 3 states and 1889 transitions. [2024-11-13 16:04:38,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 592 transitions, 1444 flow [2024-11-13 16:04:38,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 592 transitions, 1427 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-13 16:04:38,584 INFO L231 Difference]: Finished difference. Result has 593 places, 587 transitions, 1378 flow [2024-11-13 16:04:38,584 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1378, PETRI_PLACES=593, PETRI_TRANSITIONS=587} [2024-11-13 16:04:38,585 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -18 predicate places. [2024-11-13 16:04:38,585 INFO L471 AbstractCegarLoop]: Abstraction has has 593 places, 587 transitions, 1378 flow [2024-11-13 16:04:38,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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-13 16:04:38,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:38,586 INFO L204 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, 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, 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, 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, 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, 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-13 16:04:38,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 16:04:38,586 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:38,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:38,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2139831704, now seen corresponding path program 1 times [2024-11-13 16:04:38,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:38,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834293242] [2024-11-13 16:04:38,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:38,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:38,661 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-13 16:04:38,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:38,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834293242] [2024-11-13 16:04:38,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834293242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:38,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:38,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:38,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437294204] [2024-11-13 16:04:38,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:38,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:38,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:38,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:38,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:38,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-13 16:04:38,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 587 transitions, 1378 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-13 16:04:38,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:38,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-13 16:04:38,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:39,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1786] thread3EXIT-->L125: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][475], [Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, 683#(= |#race~count2~0| 0), 679#(= |#race~count1~0| 0), 776#true, 748#true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 673#(= |#race~n3~0| 0), Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, 253#L125true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), 774#(= |#race~get2~0| 0), Black: 697#true]) [2024-11-13 16:04:39,539 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is not cut-off event [2024-11-13 16:04:39,539 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is not cut-off event [2024-11-13 16:04:39,539 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is not cut-off event [2024-11-13 16:04:39,539 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is not cut-off event [2024-11-13 16:04:39,569 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1786] thread3EXIT-->L125: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][475], [Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, 683#(= |#race~count2~0| 0), 679#(= |#race~count1~0| 0), 776#true, 748#true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 673#(= |#race~n3~0| 0), Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, 253#L125true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), 774#(= |#race~get2~0| 0), Black: 697#true]) [2024-11-13 16:04:39,569 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2024-11-13 16:04:39,569 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-13 16:04:39,570 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-11-13 16:04:39,570 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-11-13 16:04:39,570 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-13 16:04:39,608 INFO L124 PetriNetUnfolderBase]: 245/2948 cut-off events. [2024-11-13 16:04:39,609 INFO L125 PetriNetUnfolderBase]: For 130/168 co-relation queries the response was YES. [2024-11-13 16:04:39,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3701 conditions, 2948 events. 245/2948 cut-off events. For 130/168 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 22579 event pairs, 43 based on Foata normal form. 2/2650 useless extension candidates. Maximal degree in co-relation 3603. Up to 210 conditions per place. [2024-11-13 16:04:39,688 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/588 dead transitions. [2024-11-13 16:04:39,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 588 transitions, 1414 flow [2024-11-13 16:04:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:04:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-13 16:04:39,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-11-13 16:04:39,692 INFO L175 Difference]: Start difference. First operand has 593 places, 587 transitions, 1378 flow. Second operand 3 states and 1892 transitions. [2024-11-13 16:04:39,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 588 transitions, 1414 flow [2024-11-13 16:04:39,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 588 transitions, 1414 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 16:04:39,705 INFO L231 Difference]: Finished difference. Result has 594 places, 586 transitions, 1380 flow [2024-11-13 16:04:39,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1380, PETRI_PLACES=594, PETRI_TRANSITIONS=586} [2024-11-13 16:04:39,710 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -17 predicate places. [2024-11-13 16:04:39,710 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 586 transitions, 1380 flow [2024-11-13 16:04:39,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-13 16:04:39,711 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:39,711 INFO L204 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, 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, 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, 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, 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, 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-13 16:04:39,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 16:04:39,712 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:39,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:39,712 INFO L85 PathProgramCache]: Analyzing trace with hash 885831502, now seen corresponding path program 1 times [2024-11-13 16:04:39,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:39,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314844670] [2024-11-13 16:04:39,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:39,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:40,098 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-13 16:04:40,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:40,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314844670] [2024-11-13 16:04:40,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314844670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:40,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:40,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:04:40,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459274219] [2024-11-13 16:04:40,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:40,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:04:40,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:40,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:04:40,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:04:41,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-13 16:04:41,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 586 transitions, 1380 flow. Second operand has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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-13 16:04:41,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:41,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-13 16:04:41,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:42,601 INFO L124 PetriNetUnfolderBase]: 517/5084 cut-off events. [2024-11-13 16:04:42,601 INFO L125 PetriNetUnfolderBase]: For 372/540 co-relation queries the response was YES. [2024-11-13 16:04:42,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6877 conditions, 5084 events. 517/5084 cut-off events. For 372/540 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 46592 event pairs, 175 based on Foata normal form. 22/4604 useless extension candidates. Maximal degree in co-relation 6776. Up to 680 conditions per place. [2024-11-13 16:04:42,681 INFO L140 encePairwiseOnDemand]: 640/655 looper letters, 66 selfloop transitions, 16 changer transitions 0/616 dead transitions. [2024-11-13 16:04:42,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 616 transitions, 1620 flow [2024-11-13 16:04:42,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 16:04:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-13 16:04:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6611 transitions. [2024-11-13 16:04:42,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.917557251908397 [2024-11-13 16:04:42,689 INFO L175 Difference]: Start difference. First operand has 594 places, 586 transitions, 1380 flow. Second operand 11 states and 6611 transitions. [2024-11-13 16:04:42,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 616 transitions, 1620 flow [2024-11-13 16:04:42,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 616 transitions, 1616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:04:42,706 INFO L231 Difference]: Finished difference. Result has 607 places, 595 transitions, 1460 flow [2024-11-13 16:04:42,707 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1460, PETRI_PLACES=607, PETRI_TRANSITIONS=595} [2024-11-13 16:04:42,707 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -4 predicate places. [2024-11-13 16:04:42,707 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 595 transitions, 1460 flow [2024-11-13 16:04:42,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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-13 16:04:42,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:42,710 INFO L204 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, 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, 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, 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, 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, 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, 1] [2024-11-13 16:04:42,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 16:04:42,710 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:42,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:42,710 INFO L85 PathProgramCache]: Analyzing trace with hash -853087608, now seen corresponding path program 1 times [2024-11-13 16:04:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:42,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048061037] [2024-11-13 16:04:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:42,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 16:04:42,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:42,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048061037] [2024-11-13 16:04:42,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048061037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:42,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:42,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:04:42,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166931111] [2024-11-13 16:04:42,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:42,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:04:42,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:42,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:04:42,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:04:43,479 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-13 16:04:43,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 595 transitions, 1460 flow. Second operand has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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-13 16:04:43,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:43,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-13 16:04:43,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:45,058 INFO L124 PetriNetUnfolderBase]: 412/5900 cut-off events. [2024-11-13 16:04:45,058 INFO L125 PetriNetUnfolderBase]: For 233/263 co-relation queries the response was YES. [2024-11-13 16:04:45,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7735 conditions, 5900 events. 412/5900 cut-off events. For 233/263 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 55365 event pairs, 52 based on Foata normal form. 2/5401 useless extension candidates. Maximal degree in co-relation 7626. Up to 214 conditions per place. [2024-11-13 16:04:45,151 INFO L140 encePairwiseOnDemand]: 638/655 looper letters, 71 selfloop transitions, 24 changer transitions 0/629 dead transitions. [2024-11-13 16:04:45,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 629 transitions, 1766 flow [2024-11-13 16:04:45,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:04:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-13 16:04:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7210 transitions. [2024-11-13 16:04:45,156 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9173027989821882 [2024-11-13 16:04:45,156 INFO L175 Difference]: Start difference. First operand has 607 places, 595 transitions, 1460 flow. Second operand 12 states and 7210 transitions. [2024-11-13 16:04:45,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 629 transitions, 1766 flow [2024-11-13 16:04:45,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 629 transitions, 1762 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:04:45,168 INFO L231 Difference]: Finished difference. Result has 621 places, 604 transitions, 1589 flow [2024-11-13 16:04:45,168 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1589, PETRI_PLACES=621, PETRI_TRANSITIONS=604} [2024-11-13 16:04:45,169 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 10 predicate places. [2024-11-13 16:04:45,169 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 604 transitions, 1589 flow [2024-11-13 16:04:45,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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-13 16:04:45,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:45,170 INFO L204 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:45,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 16:04:45,170 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:45,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash -197825564, now seen corresponding path program 1 times [2024-11-13 16:04:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:45,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316084684] [2024-11-13 16:04:45,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:45,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 16:04:45,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:45,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316084684] [2024-11-13 16:04:45,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316084684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:45,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:45,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:04:45,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092288121] [2024-11-13 16:04:45,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:45,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:04:45,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:45,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:04:45,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:04:46,169 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-13 16:04:46,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 604 transitions, 1589 flow. Second operand has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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-13 16:04:46,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:46,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-13 16:04:46,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:49,758 INFO L124 PetriNetUnfolderBase]: 933/11346 cut-off events. [2024-11-13 16:04:49,758 INFO L125 PetriNetUnfolderBase]: For 872/1015 co-relation queries the response was YES. [2024-11-13 16:04:49,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15389 conditions, 11346 events. 933/11346 cut-off events. For 872/1015 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 128271 event pairs, 171 based on Foata normal form. 20/10371 useless extension candidates. Maximal degree in co-relation 15274. Up to 512 conditions per place. [2024-11-13 16:04:50,011 INFO L140 encePairwiseOnDemand]: 638/655 looper letters, 67 selfloop transitions, 26 changer transitions 0/635 dead transitions. [2024-11-13 16:04:50,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 635 transitions, 1896 flow [2024-11-13 16:04:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:04:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-13 16:04:50,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7201 transitions. [2024-11-13 16:04:50,019 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9161577608142494 [2024-11-13 16:04:50,019 INFO L175 Difference]: Start difference. First operand has 621 places, 604 transitions, 1589 flow. Second operand 12 states and 7201 transitions. [2024-11-13 16:04:50,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 635 transitions, 1896 flow [2024-11-13 16:04:50,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 635 transitions, 1879 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-13 16:04:50,045 INFO L231 Difference]: Finished difference. Result has 632 places, 619 transitions, 1746 flow [2024-11-13 16:04:50,046 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1572, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1746, PETRI_PLACES=632, PETRI_TRANSITIONS=619} [2024-11-13 16:04:50,047 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 21 predicate places. [2024-11-13 16:04:50,047 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 619 transitions, 1746 flow [2024-11-13 16:04:50,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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-13 16:04:50,048 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:50,048 INFO L204 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:50,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 16:04:50,049 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:50,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash -881773213, now seen corresponding path program 1 times [2024-11-13 16:04:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:50,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531093811] [2024-11-13 16:04:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:50,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 16:04:50,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:50,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531093811] [2024-11-13 16:04:50,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531093811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:50,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:50,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:04:50,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713788210] [2024-11-13 16:04:50,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:50,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:04:50,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:50,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:04:50,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:04:50,948 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-13 16:04:50,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 619 transitions, 1746 flow. Second operand has 8 states, 8 states have (on average 598.5) internal successors, (4788), 8 states have internal predecessors, (4788), 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-13 16:04:50,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:50,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-13 16:04:50,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:53,117 INFO L124 PetriNetUnfolderBase]: 714/6923 cut-off events. [2024-11-13 16:04:53,117 INFO L125 PetriNetUnfolderBase]: For 1291/1480 co-relation queries the response was YES. [2024-11-13 16:04:53,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10268 conditions, 6923 events. 714/6923 cut-off events. For 1291/1480 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 68428 event pairs, 221 based on Foata normal form. 0/6328 useless extension candidates. Maximal degree in co-relation 10143. Up to 849 conditions per place. [2024-11-13 16:04:53,252 INFO L140 encePairwiseOnDemand]: 639/655 looper letters, 69 selfloop transitions, 20 changer transitions 0/642 dead transitions. [2024-11-13 16:04:53,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 642 transitions, 2016 flow [2024-11-13 16:04:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 16:04:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-13 16:04:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6604 transitions. [2024-11-13 16:04:53,257 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.916585704371964 [2024-11-13 16:04:53,257 INFO L175 Difference]: Start difference. First operand has 632 places, 619 transitions, 1746 flow. Second operand 11 states and 6604 transitions. [2024-11-13 16:04:53,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 642 transitions, 2016 flow [2024-11-13 16:04:53,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 642 places, 642 transitions, 2016 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 16:04:53,274 INFO L231 Difference]: Finished difference. Result has 645 places, 627 transitions, 1863 flow [2024-11-13 16:04:53,274 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1746, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1863, PETRI_PLACES=645, PETRI_TRANSITIONS=627} [2024-11-13 16:04:53,275 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 34 predicate places. [2024-11-13 16:04:53,275 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 627 transitions, 1863 flow [2024-11-13 16:04:53,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.5) internal successors, (4788), 8 states have internal predecessors, (4788), 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-13 16:04:53,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:53,276 INFO L204 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:53,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 16:04:53,277 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:53,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash 237086335, now seen corresponding path program 1 times [2024-11-13 16:04:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:53,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157517625] [2024-11-13 16:04:53,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 16:04:53,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:53,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157517625] [2024-11-13 16:04:53,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157517625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:53,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:53,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:04:53,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235660333] [2024-11-13 16:04:53,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:53,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:04:53,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:53,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:04:53,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:04:54,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-13 16:04:54,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 627 transitions, 1863 flow. Second operand has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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-13 16:04:54,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:54,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-13 16:04:54,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:04:57,048 INFO L124 PetriNetUnfolderBase]: 655/9738 cut-off events. [2024-11-13 16:04:57,048 INFO L125 PetriNetUnfolderBase]: For 2169/2243 co-relation queries the response was YES. [2024-11-13 16:04:57,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13956 conditions, 9738 events. 655/9738 cut-off events. For 2169/2243 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 102211 event pairs, 42 based on Foata normal form. 10/9045 useless extension candidates. Maximal degree in co-relation 13825. Up to 282 conditions per place. [2024-11-13 16:04:57,245 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/634 dead transitions. [2024-11-13 16:04:57,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 634 transitions, 1985 flow [2024-11-13 16:04:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:04:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 16:04:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-13 16:04:57,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-13 16:04:57,249 INFO L175 Difference]: Start difference. First operand has 645 places, 627 transitions, 1863 flow. Second operand 6 states and 3674 transitions. [2024-11-13 16:04:57,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 634 transitions, 1985 flow [2024-11-13 16:04:57,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 634 transitions, 1964 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-13 16:04:57,288 INFO L231 Difference]: Finished difference. Result has 642 places, 626 transitions, 1861 flow [2024-11-13 16:04:57,289 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1838, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1861, PETRI_PLACES=642, PETRI_TRANSITIONS=626} [2024-11-13 16:04:57,289 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 31 predicate places. [2024-11-13 16:04:57,289 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 626 transitions, 1861 flow [2024-11-13 16:04:57,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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-13 16:04:57,290 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:04:57,291 INFO L204 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:57,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 16:04:57,291 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:04:57,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:57,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1676949291, now seen corresponding path program 1 times [2024-11-13 16:04:57,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:57,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496701286] [2024-11-13 16:04:57,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:57,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 16:04:58,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:58,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496701286] [2024-11-13 16:04:58,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496701286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:58,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:58,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:04:58,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068274504] [2024-11-13 16:04:58,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:58,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:04:58,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:58,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:04:58,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:04:59,086 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-13 16:04:59,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 626 transitions, 1861 flow. Second operand has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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-13 16:04:59,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:04:59,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-13 16:04:59,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:05:02,387 INFO L124 PetriNetUnfolderBase]: 744/10591 cut-off events. [2024-11-13 16:05:02,387 INFO L125 PetriNetUnfolderBase]: For 2190/2317 co-relation queries the response was YES. [2024-11-13 16:05:02,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15114 conditions, 10591 events. 744/10591 cut-off events. For 2190/2317 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 113226 event pairs, 70 based on Foata normal form. 15/9809 useless extension candidates. Maximal degree in co-relation 14983. Up to 378 conditions per place. [2024-11-13 16:05:02,601 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/633 dead transitions. [2024-11-13 16:05:02,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 633 transitions, 1983 flow [2024-11-13 16:05:02,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:05:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 16:05:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-13 16:05:02,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-13 16:05:02,605 INFO L175 Difference]: Start difference. First operand has 642 places, 626 transitions, 1861 flow. Second operand 6 states and 3674 transitions. [2024-11-13 16:05:02,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 633 transitions, 1983 flow [2024-11-13 16:05:02,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 633 transitions, 1970 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-13 16:05:02,647 INFO L231 Difference]: Finished difference. Result has 642 places, 625 transitions, 1867 flow [2024-11-13 16:05:02,647 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1867, PETRI_PLACES=642, PETRI_TRANSITIONS=625} [2024-11-13 16:05:02,648 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 31 predicate places. [2024-11-13 16:05:02,648 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 625 transitions, 1867 flow [2024-11-13 16:05:02,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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-13 16:05:02,649 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:05:02,649 INFO L204 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, 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, 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, 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, 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, 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, 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-13 16:05:02,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 16:05:02,650 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:05:02,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:02,650 INFO L85 PathProgramCache]: Analyzing trace with hash -935479945, now seen corresponding path program 1 times [2024-11-13 16:05:02,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:02,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008039407] [2024-11-13 16:05:02,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:02,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 16:05:02,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008039407] [2024-11-13 16:05:02,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008039407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:02,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:02,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:05:02,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565104410] [2024-11-13 16:05:02,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:02,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:05:02,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:02,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:05:02,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:05:02,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-13 16:05:02,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 625 transitions, 1867 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-13 16:05:02,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:05:02,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-13 16:05:02,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:05:05,439 INFO L124 PetriNetUnfolderBase]: 742/9686 cut-off events. [2024-11-13 16:05:05,439 INFO L125 PetriNetUnfolderBase]: For 1556/1576 co-relation queries the response was YES. [2024-11-13 16:05:05,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13402 conditions, 9686 events. 742/9686 cut-off events. For 1556/1576 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 97762 event pairs, 79 based on Foata normal form. 0/8959 useless extension candidates. Maximal degree in co-relation 13271. Up to 558 conditions per place. [2024-11-13 16:05:05,624 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 19 selfloop transitions, 2 changer transitions 0/627 dead transitions. [2024-11-13 16:05:05,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 627 transitions, 1917 flow [2024-11-13 16:05:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:05:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:05:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1888 transitions. [2024-11-13 16:05:05,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9608142493638677 [2024-11-13 16:05:05,627 INFO L175 Difference]: Start difference. First operand has 642 places, 625 transitions, 1867 flow. Second operand 3 states and 1888 transitions. [2024-11-13 16:05:05,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 627 transitions, 1917 flow [2024-11-13 16:05:05,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 627 transitions, 1904 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-13 16:05:05,660 INFO L231 Difference]: Finished difference. Result has 637 places, 623 transitions, 1860 flow [2024-11-13 16:05:05,661 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1846, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1860, PETRI_PLACES=637, PETRI_TRANSITIONS=623} [2024-11-13 16:05:05,661 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 26 predicate places. [2024-11-13 16:05:05,662 INFO L471 AbstractCegarLoop]: Abstraction has has 637 places, 623 transitions, 1860 flow [2024-11-13 16:05:05,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-13 16:05:05,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:05:05,662 INFO L204 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, 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, 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, 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, 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, 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, 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-13 16:05:05,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-13 16:05:05,663 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:05:05,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:05,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1107176923, now seen corresponding path program 1 times [2024-11-13 16:05:05,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:05,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015798045] [2024-11-13 16:05:05,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:05,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 16:05:06,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:06,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015798045] [2024-11-13 16:05:06,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015798045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:06,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:06,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:05:06,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680170327] [2024-11-13 16:05:06,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:06,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:05:06,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:06,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:05:06,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:05:07,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-13 16:05:07,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 623 transitions, 1860 flow. Second operand has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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-13 16:05:07,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:05:07,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-13 16:05:07,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:05:10,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1504] L50-8-->L50-9: Formula: (= |v_#race~get2~0_1| 0) InVars {} OutVars{#race~get2~0=|v_#race~get2~0_1|} AuxVars[] AssignedVars[#race~get2~0][573], [Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, 882#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 679#(= |#race~count1~0| 0), 615#L122-4true, 244#L70-1true, 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 673#(= |#race~n3~0| 0), Black: 784#(<= ~n2~0 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), 774#(= |#race~get2~0| 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#true, 804#true, 683#(= |#race~count2~0| 0), 94#L50-9true, Black: 847#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 834#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), 748#true, Black: 833#(<= ~n3~0 0), Black: 712#(<= ~n1~0 0), 895#true, Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 623#L90-1true, Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 859#(<= ~n3~0 0), Black: 873#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 891#true]) [2024-11-13 16:05:10,024 INFO L294 olderBase$Statistics]: this new event has 389 ancestors and is cut-off event [2024-11-13 16:05:10,024 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-13 16:05:10,024 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-13 16:05:10,024 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-13 16:05:10,030 INFO L124 PetriNetUnfolderBase]: 730/10903 cut-off events. [2024-11-13 16:05:10,030 INFO L125 PetriNetUnfolderBase]: For 2307/2387 co-relation queries the response was YES. [2024-11-13 16:05:10,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15554 conditions, 10903 events. 730/10903 cut-off events. For 2307/2387 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 114967 event pairs, 45 based on Foata normal form. 10/10221 useless extension candidates. Maximal degree in co-relation 15422. Up to 306 conditions per place. [2024-11-13 16:05:10,245 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/629 dead transitions. [2024-11-13 16:05:10,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 629 transitions, 1976 flow [2024-11-13 16:05:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:05:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 16:05:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-13 16:05:10,248 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-13 16:05:10,248 INFO L175 Difference]: Start difference. First operand has 637 places, 623 transitions, 1860 flow. Second operand 6 states and 3674 transitions. [2024-11-13 16:05:10,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 629 transitions, 1976 flow [2024-11-13 16:05:10,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 629 transitions, 1976 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 16:05:10,276 INFO L231 Difference]: Finished difference. Result has 640 places, 621 transitions, 1868 flow [2024-11-13 16:05:10,276 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1856, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1868, PETRI_PLACES=640, PETRI_TRANSITIONS=621} [2024-11-13 16:05:10,277 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 29 predicate places. [2024-11-13 16:05:10,277 INFO L471 AbstractCegarLoop]: Abstraction has has 640 places, 621 transitions, 1868 flow [2024-11-13 16:05:10,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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-13 16:05:10,278 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:05:10,278 INFO L204 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, 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, 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, 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, 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, 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, 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-13 16:05:10,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 16:05:10,278 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:05:10,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:10,279 INFO L85 PathProgramCache]: Analyzing trace with hash -307114648, now seen corresponding path program 1 times [2024-11-13 16:05:10,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:10,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970672033] [2024-11-13 16:05:10,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:10,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 16:05:10,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:10,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970672033] [2024-11-13 16:05:10,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970672033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:10,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:10,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:05:10,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434313371] [2024-11-13 16:05:10,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:10,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:05:10,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:10,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:05:10,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:05:11,889 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-13 16:05:11,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 621 transitions, 1868 flow. Second operand has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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-13 16:05:11,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:05:11,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-13 16:05:11,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:05:14,081 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1785] thread2EXIT-->L124: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][599], [Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), 572#L124true, Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, 679#(= |#race~count1~0| 0), 903#(= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 673#(= |#race~n3~0| 0), Black: 784#(<= ~n2~0 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), 774#(= |#race~get2~0| 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#true, 804#true, 683#(= |#race~count2~0| 0), Black: 847#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 183#L90-4true, Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 834#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), 748#true, Black: 833#(<= ~n3~0 0), Black: 712#(<= ~n1~0 0), 895#true, Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 859#(<= ~n3~0 0), Black: 873#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 882#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 891#true]) [2024-11-13 16:05:14,081 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-11-13 16:05:14,081 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-13 16:05:14,082 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2024-11-13 16:05:14,082 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-13 16:05:14,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1785] thread2EXIT-->L124: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][603], [Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), 572#L124true, Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, 679#(= |#race~count1~0| 0), 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 673#(= |#race~n3~0| 0), Black: 784#(<= ~n2~0 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 904#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), 774#(= |#race~get2~0| 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#true, 804#true, 683#(= |#race~count2~0| 0), Black: 847#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 834#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), 748#true, Black: 833#(<= ~n3~0 0), Black: 712#(<= ~n1~0 0), 895#true, Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 859#(<= ~n3~0 0), Black: 873#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 567#L90-5true, Black: 860#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 882#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 891#true]) [2024-11-13 16:05:14,085 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2024-11-13 16:05:14,085 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-13 16:05:14,085 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-13 16:05:14,086 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-11-13 16:05:14,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1785] thread2EXIT-->L124: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][607], [Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), 30#L90-6true, 572#L124true, Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, 905#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 673#(= |#race~n3~0| 0), Black: 784#(<= ~n2~0 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), 774#(= |#race~get2~0| 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#true, 804#true, 683#(= |#race~count2~0| 0), Black: 847#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 834#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), 748#true, Black: 833#(<= ~n3~0 0), Black: 712#(<= ~n1~0 0), 895#true, Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 859#(<= ~n3~0 0), Black: 873#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 882#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 891#true]) [2024-11-13 16:05:14,089 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2024-11-13 16:05:14,089 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-13 16:05:14,089 INFO L297 olderBase$Statistics]: existing Event has 328 ancestors and is cut-off event [2024-11-13 16:05:14,089 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-13 16:05:14,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1785] thread2EXIT-->L124: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][610], [Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), 572#L124true, Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), 612#L90-7true, Black: 772#true, 906#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 673#(= |#race~n3~0| 0), Black: 784#(<= ~n2~0 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), 774#(= |#race~get2~0| 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#true, 804#true, 683#(= |#race~count2~0| 0), Black: 847#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 834#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), 748#true, Black: 833#(<= ~n3~0 0), Black: 712#(<= ~n1~0 0), 895#true, Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 859#(<= ~n3~0 0), Black: 873#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 882#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 891#true]) [2024-11-13 16:05:14,093 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2024-11-13 16:05:14,093 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2024-11-13 16:05:14,093 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-13 16:05:14,093 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-13 16:05:14,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1785] thread2EXIT-->L124: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][610], [Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), 572#L124true, Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, 906#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 673#(= |#race~n3~0| 0), Black: 784#(<= ~n2~0 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), 774#(= |#race~get2~0| 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#true, 804#true, 683#(= |#race~count2~0| 0), Black: 847#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 834#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), 748#true, Black: 833#(<= ~n3~0 0), Black: 712#(<= ~n1~0 0), 895#true, Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 351#L90-8true, Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 859#(<= ~n3~0 0), Black: 873#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 882#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 891#true]) [2024-11-13 16:05:14,098 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2024-11-13 16:05:14,098 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-13 16:05:14,098 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-13 16:05:14,098 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2024-11-13 16:05:14,119 INFO L124 PetriNetUnfolderBase]: 641/6977 cut-off events. [2024-11-13 16:05:14,119 INFO L125 PetriNetUnfolderBase]: For 2198/2510 co-relation queries the response was YES. [2024-11-13 16:05:14,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10591 conditions, 6977 events. 641/6977 cut-off events. For 2198/2510 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 67470 event pairs, 87 based on Foata normal form. 39/6607 useless extension candidates. Maximal degree in co-relation 10458. Up to 441 conditions per place. [2024-11-13 16:05:14,261 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/628 dead transitions. [2024-11-13 16:05:14,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 628 transitions, 1990 flow [2024-11-13 16:05:14,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:05:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 16:05:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-13 16:05:14,265 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-13 16:05:14,265 INFO L175 Difference]: Start difference. First operand has 640 places, 621 transitions, 1868 flow. Second operand 6 states and 3674 transitions. [2024-11-13 16:05:14,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 628 transitions, 1990 flow [2024-11-13 16:05:14,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 628 transitions, 1978 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-13 16:05:14,292 INFO L231 Difference]: Finished difference. Result has 639 places, 620 transitions, 1875 flow [2024-11-13 16:05:14,293 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1875, PETRI_PLACES=639, PETRI_TRANSITIONS=620} [2024-11-13 16:05:14,293 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 28 predicate places. [2024-11-13 16:05:14,293 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 620 transitions, 1875 flow [2024-11-13 16:05:14,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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-13 16:05:14,294 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:05:14,295 INFO L204 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, 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, 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, 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, 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, 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, 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-13 16:05:14,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 16:05:14,295 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:05:14,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1561508101, now seen corresponding path program 1 times [2024-11-13 16:05:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:14,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171169138] [2024-11-13 16:05:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 16:05:14,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:14,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171169138] [2024-11-13 16:05:14,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171169138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:14,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:14,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:05:14,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475563211] [2024-11-13 16:05:14,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:14,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:05:14,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:14,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:05:14,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:05:15,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-13 16:05:15,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 620 transitions, 1875 flow. Second operand has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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-13 16:05:15,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:05:15,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-13 16:05:15,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:05:18,241 INFO L124 PetriNetUnfolderBase]: 785/11057 cut-off events. [2024-11-13 16:05:18,241 INFO L125 PetriNetUnfolderBase]: For 2558/2676 co-relation queries the response was YES. [2024-11-13 16:05:18,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16393 conditions, 11057 events. 785/11057 cut-off events. For 2558/2676 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 119353 event pairs, 72 based on Foata normal form. 17/10450 useless extension candidates. Maximal degree in co-relation 16259. Up to 417 conditions per place. [2024-11-13 16:05:18,462 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/626 dead transitions. [2024-11-13 16:05:18,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 626 transitions, 1991 flow [2024-11-13 16:05:18,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:05:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 16:05:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-13 16:05:18,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-13 16:05:18,466 INFO L175 Difference]: Start difference. First operand has 639 places, 620 transitions, 1875 flow. Second operand 6 states and 3674 transitions. [2024-11-13 16:05:18,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 626 transitions, 1991 flow [2024-11-13 16:05:18,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 626 transitions, 1978 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-13 16:05:18,508 INFO L231 Difference]: Finished difference. Result has 638 places, 618 transitions, 1870 flow [2024-11-13 16:05:18,509 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1870, PETRI_PLACES=638, PETRI_TRANSITIONS=618} [2024-11-13 16:05:18,509 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 27 predicate places. [2024-11-13 16:05:18,509 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 618 transitions, 1870 flow [2024-11-13 16:05:18,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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-13 16:05:18,510 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:05:18,510 INFO L204 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, 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, 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, 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, 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, 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, 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-13 16:05:18,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-13 16:05:18,511 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:05:18,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash -311555351, now seen corresponding path program 1 times [2024-11-13 16:05:18,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:18,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165183574] [2024-11-13 16:05:18,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:18,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:18,574 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-13 16:05:18,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:18,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165183574] [2024-11-13 16:05:18,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165183574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:18,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:18,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:05:18,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513396174] [2024-11-13 16:05:18,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:18,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:05:18,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:18,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:05:18,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:05:18,594 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 655 [2024-11-13 16:05:18,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 618 transitions, 1870 flow. Second operand has 3 states, 3 states have (on average 631.0) internal successors, (1893), 3 states have internal predecessors, (1893), 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-13 16:05:18,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:05:18,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 655 [2024-11-13 16:05:18,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:05:21,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1786] thread3EXIT-->L125: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][435], [Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, Black: 906#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, 914#true, 253#L125true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 774#(= |#race~get2~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#true, 804#true, 683#(= |#race~count2~0| 0), Black: 847#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 834#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), 748#true, Black: 833#(<= ~n3~0 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), 908#true, Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 859#(<= ~n3~0 0), Black: 873#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 882#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 891#true]) [2024-11-13 16:05:21,172 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2024-11-13 16:05:21,172 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-11-13 16:05:21,172 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-11-13 16:05:21,172 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2024-11-13 16:05:21,196 INFO L124 PetriNetUnfolderBase]: 643/10323 cut-off events. [2024-11-13 16:05:21,196 INFO L125 PetriNetUnfolderBase]: For 2091/2125 co-relation queries the response was YES. [2024-11-13 16:05:21,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14774 conditions, 10323 events. 643/10323 cut-off events. For 2091/2125 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 107209 event pairs, 42 based on Foata normal form. 0/9769 useless extension candidates. Maximal degree in co-relation 14641. Up to 304 conditions per place. [2024-11-13 16:05:21,396 INFO L140 encePairwiseOnDemand]: 653/655 looper letters, 10 selfloop transitions, 1 changer transitions 0/617 dead transitions. [2024-11-13 16:05:21,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 617 transitions, 1890 flow [2024-11-13 16:05:21,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:05:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:05:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-11-13 16:05:21,398 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-11-13 16:05:21,399 INFO L175 Difference]: Start difference. First operand has 638 places, 618 transitions, 1870 flow. Second operand 3 states and 1896 transitions. [2024-11-13 16:05:21,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 617 transitions, 1890 flow [2024-11-13 16:05:21,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 617 transitions, 1878 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-13 16:05:21,431 INFO L231 Difference]: Finished difference. Result has 634 places, 617 transitions, 1858 flow [2024-11-13 16:05:21,432 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1856, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1858, PETRI_PLACES=634, PETRI_TRANSITIONS=617} [2024-11-13 16:05:21,432 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 23 predicate places. [2024-11-13 16:05:21,432 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 617 transitions, 1858 flow [2024-11-13 16:05:21,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 631.0) internal successors, (1893), 3 states have internal predecessors, (1893), 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-13 16:05:21,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:05:21,433 INFO L204 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, 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, 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, 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, 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, 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, 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-13 16:05:21,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-13 16:05:21,433 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:05:21,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:21,434 INFO L85 PathProgramCache]: Analyzing trace with hash 518066446, now seen corresponding path program 1 times [2024-11-13 16:05:21,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:21,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726756841] [2024-11-13 16:05:21,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:21,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 16:05:22,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:22,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726756841] [2024-11-13 16:05:22,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726756841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:22,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:22,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:05:22,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43962868] [2024-11-13 16:05:22,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:22,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:05:22,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:22,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:05:22,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:05:23,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-13 16:05:23,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 617 transitions, 1858 flow. Second operand has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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-13 16:05:23,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:05:23,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-13 16:05:23,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:05:25,077 INFO L124 PetriNetUnfolderBase]: 577/6749 cut-off events. [2024-11-13 16:05:25,077 INFO L125 PetriNetUnfolderBase]: For 2402/2680 co-relation queries the response was YES. [2024-11-13 16:05:25,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10265 conditions, 6749 events. 577/6749 cut-off events. For 2402/2680 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 64484 event pairs, 87 based on Foata normal form. 37/6463 useless extension candidates. Maximal degree in co-relation 10131. Up to 445 conditions per place. [2024-11-13 16:05:25,196 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/623 dead transitions. [2024-11-13 16:05:25,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 623 transitions, 1974 flow [2024-11-13 16:05:25,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:05:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 16:05:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-13 16:05:25,199 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-13 16:05:25,200 INFO L175 Difference]: Start difference. First operand has 634 places, 617 transitions, 1858 flow. Second operand 6 states and 3674 transitions. [2024-11-13 16:05:25,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 623 transitions, 1974 flow [2024-11-13 16:05:25,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 623 transitions, 1973 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:05:25,228 INFO L231 Difference]: Finished difference. Result has 636 places, 615 transitions, 1865 flow [2024-11-13 16:05:25,229 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1853, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1865, PETRI_PLACES=636, PETRI_TRANSITIONS=615} [2024-11-13 16:05:25,230 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 25 predicate places. [2024-11-13 16:05:25,230 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 615 transitions, 1865 flow [2024-11-13 16:05:25,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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-13 16:05:25,230 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:05:25,231 INFO L204 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2024-11-13 16:05:25,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-13 16:05:25,231 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:05:25,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:25,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1870163093, now seen corresponding path program 1 times [2024-11-13 16:05:25,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:25,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86729053] [2024-11-13 16:05:25,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:25,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:25,294 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-13 16:05:25,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:25,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86729053] [2024-11-13 16:05:25,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86729053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:25,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:25,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:05:25,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88950886] [2024-11-13 16:05:25,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:25,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:05:25,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:25,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:05:25,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:05:25,322 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-13 16:05:25,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 615 transitions, 1865 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-13 16:05:25,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:05:25,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-13 16:05:25,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:05:27,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1786] thread3EXIT-->L125: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][435], [Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, Black: 906#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 253#L125true, 917#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), 774#(= |#race~get2~0| 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#true, 804#true, 683#(= |#race~count2~0| 0), Black: 847#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 834#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), 748#true, Black: 833#(<= ~n3~0 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 859#(<= ~n3~0 0), Black: 873#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 923#true, Black: 882#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 891#true]) [2024-11-13 16:05:27,993 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2024-11-13 16:05:27,994 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2024-11-13 16:05:27,994 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-11-13 16:05:27,994 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-11-13 16:05:28,026 INFO L124 PetriNetUnfolderBase]: 687/10501 cut-off events. [2024-11-13 16:05:28,026 INFO L125 PetriNetUnfolderBase]: For 1975/2041 co-relation queries the response was YES. [2024-11-13 16:05:28,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15203 conditions, 10501 events. 687/10501 cut-off events. For 1975/2041 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 109374 event pairs, 72 based on Foata normal form. 0/10015 useless extension candidates. Maximal degree in co-relation 15070. Up to 388 conditions per place. [2024-11-13 16:05:28,224 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 12 selfloop transitions, 1 changer transitions 0/613 dead transitions. [2024-11-13 16:05:28,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 613 transitions, 1887 flow [2024-11-13 16:05:28,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:05:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:05:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1890 transitions. [2024-11-13 16:05:28,226 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9618320610687023 [2024-11-13 16:05:28,227 INFO L175 Difference]: Start difference. First operand has 636 places, 615 transitions, 1865 flow. Second operand 3 states and 1890 transitions. [2024-11-13 16:05:28,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 613 transitions, 1887 flow [2024-11-13 16:05:28,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 613 transitions, 1875 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-13 16:05:28,260 INFO L231 Difference]: Finished difference. Result has 631 places, 613 transitions, 1851 flow [2024-11-13 16:05:28,260 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1849, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1851, PETRI_PLACES=631, PETRI_TRANSITIONS=613} [2024-11-13 16:05:28,261 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 20 predicate places. [2024-11-13 16:05:28,261 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 613 transitions, 1851 flow [2024-11-13 16:05:28,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-13 16:05:28,261 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:05:28,261 INFO L204 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:05:28,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-13 16:05:28,261 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:05:28,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:28,262 INFO L85 PathProgramCache]: Analyzing trace with hash 442304733, now seen corresponding path program 1 times [2024-11-13 16:05:28,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:28,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982968604] [2024-11-13 16:05:28,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:28,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:28,305 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-13 16:05:28,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:28,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982968604] [2024-11-13 16:05:28,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982968604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:28,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:28,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:05:28,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534139469] [2024-11-13 16:05:28,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:28,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:05:28,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:28,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:05:28,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:05:28,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-13 16:05:28,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 613 transitions, 1851 flow. Second operand has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-13 16:05:28,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:05:28,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-13 16:05:28,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:05:29,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1720] L97-6-->L97-7: Formula: (= |v_#race~res3~0_4| |v_thread3Thread1of1ForFork0_#t~nondet26_3|) InVars {thread3Thread1of1ForFork0_#t~nondet26=|v_thread3Thread1of1ForFork0_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork0_#t~nondet26=|v_thread3Thread1of1ForFork0_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][394], [Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), 572#L124true, Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, Black: 906#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 926#true, 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 774#(= |#race~get2~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#true, 804#true, 683#(= |#race~count2~0| 0), Black: 847#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 834#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), 748#true, Black: 833#(<= ~n3~0 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 859#(<= ~n3~0 0), Black: 873#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 454#L97-7true, Black: 860#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 923#true, Black: 882#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 891#true]) [2024-11-13 16:05:29,900 INFO L294 olderBase$Statistics]: this new event has 390 ancestors and is cut-off event [2024-11-13 16:05:29,900 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-13 16:05:29,900 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-13 16:05:29,900 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-13 16:05:29,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1786] thread3EXIT-->L125: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][435], [Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, Black: 906#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 926#true, 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, 253#L125true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 774#(= |#race~get2~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#true, 804#true, 683#(= |#race~count2~0| 0), Black: 847#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 834#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), 748#true, Black: 833#(<= ~n3~0 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 859#(<= ~n3~0 0), Black: 873#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 923#true, Black: 882#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 891#true]) [2024-11-13 16:05:29,911 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2024-11-13 16:05:29,911 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2024-11-13 16:05:29,911 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is cut-off event [2024-11-13 16:05:29,911 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2024-11-13 16:05:29,912 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1786] thread3EXIT-->L125: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][435], [Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, Black: 906#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 926#true, 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, 253#L125true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 774#(= |#race~get2~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#true, 804#true, 683#(= |#race~count2~0| 0), Black: 847#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 834#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), 748#true, Black: 833#(<= ~n3~0 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 859#(<= ~n3~0 0), Black: 873#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 923#true, Black: 882#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 891#true]) [2024-11-13 16:05:29,912 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2024-11-13 16:05:29,912 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-11-13 16:05:29,912 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-11-13 16:05:29,912 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2024-11-13 16:05:29,912 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-11-13 16:05:29,915 INFO L124 PetriNetUnfolderBase]: 441/5955 cut-off events. [2024-11-13 16:05:29,915 INFO L125 PetriNetUnfolderBase]: For 1158/1218 co-relation queries the response was YES. [2024-11-13 16:05:29,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8665 conditions, 5955 events. 441/5955 cut-off events. For 1158/1218 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 55171 event pairs, 87 based on Foata normal form. 15/5680 useless extension candidates. Maximal degree in co-relation 8532. Up to 367 conditions per place. [2024-11-13 16:05:30,006 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 8 selfloop transitions, 0 changer transitions 28/611 dead transitions. [2024-11-13 16:05:30,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 611 transitions, 1871 flow [2024-11-13 16:05:30,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:05:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:05:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-11-13 16:05:30,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-11-13 16:05:30,008 INFO L175 Difference]: Start difference. First operand has 631 places, 613 transitions, 1851 flow. Second operand 3 states and 1889 transitions. [2024-11-13 16:05:30,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 611 transitions, 1871 flow [2024-11-13 16:05:30,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 611 transitions, 1870 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:05:30,026 INFO L231 Difference]: Finished difference. Result has 630 places, 583 transitions, 1701 flow [2024-11-13 16:05:30,026 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1846, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1701, PETRI_PLACES=630, PETRI_TRANSITIONS=583} [2024-11-13 16:05:30,027 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 19 predicate places. [2024-11-13 16:05:30,027 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 583 transitions, 1701 flow [2024-11-13 16:05:30,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-13 16:05:30,027 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:05:30,028 INFO L204 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:05:30,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-13 16:05:30,028 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:05:30,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:30,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1639879082, now seen corresponding path program 1 times [2024-11-13 16:05:30,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:30,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633690049] [2024-11-13 16:05:30,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:30,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 16:05:30,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:30,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633690049] [2024-11-13 16:05:30,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633690049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:30,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:30,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:05:30,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345574929] [2024-11-13 16:05:30,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:30,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:05:30,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:30,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:05:30,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:05:30,131 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-13 16:05:30,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 583 transitions, 1701 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-13 16:05:30,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:05:30,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-13 16:05:30,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:05:32,298 INFO L124 PetriNetUnfolderBase]: 590/9291 cut-off events. [2024-11-13 16:05:32,298 INFO L125 PetriNetUnfolderBase]: For 1533/1559 co-relation queries the response was YES. [2024-11-13 16:05:32,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13021 conditions, 9291 events. 590/9291 cut-off events. For 1533/1559 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 93235 event pairs, 42 based on Foata normal form. 0/8884 useless extension candidates. Maximal degree in co-relation 12979. Up to 261 conditions per place. [2024-11-13 16:05:32,456 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 11 selfloop transitions, 2 changer transitions 15/584 dead transitions. [2024-11-13 16:05:32,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 584 transitions, 1731 flow [2024-11-13 16:05:32,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:05:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:05:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-13 16:05:32,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-11-13 16:05:32,458 INFO L175 Difference]: Start difference. First operand has 630 places, 583 transitions, 1701 flow. Second operand 3 states and 1892 transitions. [2024-11-13 16:05:32,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 584 transitions, 1731 flow [2024-11-13 16:05:32,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 584 transitions, 1719 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-11-13 16:05:32,484 INFO L231 Difference]: Finished difference. Result has 610 places, 567 transitions, 1578 flow [2024-11-13 16:05:32,485 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1687, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1578, PETRI_PLACES=610, PETRI_TRANSITIONS=567} [2024-11-13 16:05:32,485 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -1 predicate places. [2024-11-13 16:05:32,485 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 567 transitions, 1578 flow [2024-11-13 16:05:32,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-13 16:05:32,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:05:32,486 INFO L204 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:05:32,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-13 16:05:32,486 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread2Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:05:32,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:32,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1806791121, now seen corresponding path program 1 times [2024-11-13 16:05:32,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:32,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331776666] [2024-11-13 16:05:32,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:32,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 16:05:32,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:32,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331776666] [2024-11-13 16:05:32,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331776666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:32,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:32,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:05:32,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206740534] [2024-11-13 16:05:32,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:32,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:05:32,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:32,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:05:32,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:05:32,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-13 16:05:32,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 567 transitions, 1578 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-13 16:05:32,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:05:32,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-13 16:05:32,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:05:34,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1504] L50-8-->L50-9: Formula: (= |v_#race~get2~0_1| 0) InVars {} OutVars{#race~get2~0=|v_#race~get2~0_1|} AuxVars[] AssignedVars[#race~get2~0][492], [Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, Black: 906#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 615#L122-4true, 244#L70-1true, 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 673#(= |#race~n3~0| 0), Black: 784#(<= ~n2~0 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 926#true, 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), 774#(= |#race~get2~0| 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#true, 804#true, 683#(= |#race~count2~0| 0), 94#L50-9true, Black: 847#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 834#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), 748#true, Black: 833#(<= ~n3~0 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 932#true, 623#L90-1true, Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), 929#true, Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 859#(<= ~n3~0 0), Black: 873#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 891#true]) [2024-11-13 16:05:34,583 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2024-11-13 16:05:34,583 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-11-13 16:05:34,583 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-11-13 16:05:34,583 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-13 16:05:34,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1785] thread2EXIT-->L124: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][422], [572#L124true, Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, Black: 906#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 926#true, 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), 774#(= |#race~get2~0| 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#true, 804#true, 683#(= |#race~count2~0| 0), Black: 847#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 834#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), 748#true, Black: 833#(<= ~n3~0 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 932#true, 623#L90-1true, Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), 929#true, Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 859#(<= ~n3~0 0), Black: 873#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 882#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 891#true]) [2024-11-13 16:05:34,615 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2024-11-13 16:05:34,615 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2024-11-13 16:05:34,615 INFO L297 olderBase$Statistics]: existing Event has 385 ancestors and is cut-off event [2024-11-13 16:05:34,615 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2024-11-13 16:05:34,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1607] L77-6-->L77-7: Formula: (= |v_thread2Thread1of1ForFork2_#t~nondet17_3| |v_#race~res2~0_7|) InVars {thread2Thread1of1ForFork2_#t~nondet17=|v_thread2Thread1of1ForFork2_#t~nondet17_3|} OutVars{thread2Thread1of1ForFork2_#t~nondet17=|v_thread2Thread1of1ForFork2_#t~nondet17_3|, #race~res2~0=|v_#race~res2~0_7|} AuxVars[] AssignedVars[#race~res2~0][349], [Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, Black: 906#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 679#(= |#race~count1~0| 0), 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 926#true, 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 182#L123-1true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), 774#(= |#race~get2~0| 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#true, 804#true, 683#(= |#race~count2~0| 0), Black: 847#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 834#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), 748#true, Black: 833#(<= ~n3~0 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 75#L77-7true, 932#true, 623#L90-1true, Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), 929#true, Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 859#(<= ~n3~0 0), Black: 873#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 882#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 891#true]) [2024-11-13 16:05:34,617 INFO L294 olderBase$Statistics]: this new event has 373 ancestors and is cut-off event [2024-11-13 16:05:34,618 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-13 16:05:34,618 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-13 16:05:34,618 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-13 16:05:34,618 INFO L124 PetriNetUnfolderBase]: 527/7901 cut-off events. [2024-11-13 16:05:34,618 INFO L125 PetriNetUnfolderBase]: For 981/1040 co-relation queries the response was YES. [2024-11-13 16:05:34,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10894 conditions, 7901 events. 527/7901 cut-off events. For 981/1040 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 76465 event pairs, 61 based on Foata normal form. 0/7573 useless extension candidates. Maximal degree in co-relation 10851. Up to 233 conditions per place. [2024-11-13 16:05:34,757 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 11 selfloop transitions, 2 changer transitions 14/568 dead transitions. [2024-11-13 16:05:34,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 568 transitions, 1608 flow [2024-11-13 16:05:34,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:05:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:05:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-11-13 16:05:34,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-11-13 16:05:34,759 INFO L175 Difference]: Start difference. First operand has 610 places, 567 transitions, 1578 flow. Second operand 3 states and 1889 transitions. [2024-11-13 16:05:34,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 568 transitions, 1608 flow [2024-11-13 16:05:34,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 568 transitions, 1548 flow, removed 13 selfloop flow, removed 15 redundant places. [2024-11-13 16:05:34,794 INFO L231 Difference]: Finished difference. Result has 589 places, 552 transitions, 1428 flow [2024-11-13 16:05:34,795 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1428, PETRI_PLACES=589, PETRI_TRANSITIONS=552} [2024-11-13 16:05:34,795 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-11-13 16:05:34,796 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 552 transitions, 1428 flow [2024-11-13 16:05:34,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-13 16:05:34,796 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:05:34,796 INFO L204 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, 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, 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, 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, 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, 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, 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, 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-13 16:05:34,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-13 16:05:34,797 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread3Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-13 16:05:34,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:34,797 INFO L85 PathProgramCache]: Analyzing trace with hash -907506833, now seen corresponding path program 1 times [2024-11-13 16:05:34,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:34,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682530419] [2024-11-13 16:05:34,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:34,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 16:05:34,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:34,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682530419] [2024-11-13 16:05:34,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682530419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:34,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:34,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:05:34,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990529174] [2024-11-13 16:05:34,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:34,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:05:34,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:34,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:05:34,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:05:34,913 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-13 16:05:34,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 552 transitions, 1428 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-13 16:05:34,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:05:34,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-13 16:05:34,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:05:35,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1785] thread2EXIT-->L124: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][389], [572#L124true, Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, 804#true, Black: 906#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 683#(= |#race~count2~0| 0), 679#(= |#race~count1~0| 0), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 748#true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 932#true, Black: 784#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), 699#(= |#race~get1~0| 0), 926#true, Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 677#true, 655#(= |#race~n1~0| 0), 935#true, Black: 681#true, 454#L97-7true, Black: 685#true, Black: 882#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 774#(= |#race~get2~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 697#true, Black: 891#true]) [2024-11-13 16:05:35,715 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is not cut-off event [2024-11-13 16:05:35,715 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-11-13 16:05:35,715 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-11-13 16:05:35,715 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is not cut-off event [2024-11-13 16:05:35,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1720] L97-6-->L97-7: Formula: (= |v_#race~res3~0_4| |v_thread3Thread1of1ForFork0_#t~nondet26_3|) InVars {thread3Thread1of1ForFork0_#t~nondet26=|v_thread3Thread1of1ForFork0_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork0_#t~nondet26=|v_thread3Thread1of1ForFork0_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][396], [572#L124true, Black: 767#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 754#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 753#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 772#true, 804#true, Black: 906#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 683#(= |#race~count2~0| 0), 679#(= |#race~count1~0| 0), Black: 839#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 748#true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 893#(= |#race~get3~0| 0), Black: 790#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 792#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 932#true, Black: 784#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 785#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 737#(not |thread2Thread1of1ForFork2_#t~short10|), Black: 798#(and (not |thread3Thread1of1ForFork0_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 699#(= |#race~get1~0| 0), 926#true, Black: 742#(not |thread3Thread1of1ForFork0_#t~short19|), Black: 677#true, 655#(= |#race~n1~0| 0), 935#true, Black: 681#true, 454#L97-7true, Black: 685#true, Black: 882#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 809#(<= ~n2~0 0), Black: 823#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 774#(= |#race~get2~0| 0), Black: 810#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 889#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0)), 828#true, Black: 697#true, Black: 891#true]) [2024-11-13 16:05:35,720 INFO L294 olderBase$Statistics]: this new event has 374 ancestors and is cut-off event [2024-11-13 16:05:35,720 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-13 16:05:35,720 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-13 16:05:35,720 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-13 16:05:35,720 INFO L124 PetriNetUnfolderBase]: 276/3453 cut-off events. [2024-11-13 16:05:35,720 INFO L125 PetriNetUnfolderBase]: For 277/331 co-relation queries the response was YES. [2024-11-13 16:05:35,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4633 conditions, 3453 events. 276/3453 cut-off events. For 277/331 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 26918 event pairs, 54 based on Foata normal form. 2/3284 useless extension candidates. Maximal degree in co-relation 4597. Up to 190 conditions per place. [2024-11-13 16:05:35,766 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 0 selfloop transitions, 0 changer transitions 553/553 dead transitions. [2024-11-13 16:05:35,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 553 transitions, 1458 flow [2024-11-13 16:05:35,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:05:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:05:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-11-13 16:05:35,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-11-13 16:05:35,769 INFO L175 Difference]: Start difference. First operand has 589 places, 552 transitions, 1428 flow. Second operand 3 states and 1889 transitions. [2024-11-13 16:05:35,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 553 transitions, 1458 flow [2024-11-13 16:05:35,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 553 transitions, 1404 flow, removed 11 selfloop flow, removed 15 redundant places. [2024-11-13 16:05:35,780 INFO L231 Difference]: Finished difference. Result has 568 places, 0 transitions, 0 flow [2024-11-13 16:05:35,781 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=568, PETRI_TRANSITIONS=0} [2024-11-13 16:05:35,781 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -43 predicate places. [2024-11-13 16:05:35,781 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 0 transitions, 0 flow [2024-11-13 16:05:35,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-13 16:05:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (136 of 137 remaining) [2024-11-13 16:05:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (135 of 137 remaining) [2024-11-13 16:05:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (134 of 137 remaining) [2024-11-13 16:05:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (133 of 137 remaining) [2024-11-13 16:05:35,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (132 of 137 remaining) [2024-11-13 16:05:35,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (131 of 137 remaining) [2024-11-13 16:05:35,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (130 of 137 remaining) [2024-11-13 16:05:35,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (129 of 137 remaining) [2024-11-13 16:05:35,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (128 of 137 remaining) [2024-11-13 16:05:35,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (127 of 137 remaining) [2024-11-13 16:05:35,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (126 of 137 remaining) [2024-11-13 16:05:35,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (125 of 137 remaining) [2024-11-13 16:05:35,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (124 of 137 remaining) [2024-11-13 16:05:35,788 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (123 of 137 remaining) [2024-11-13 16:05:35,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (122 of 137 remaining) [2024-11-13 16:05:35,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (121 of 137 remaining) [2024-11-13 16:05:35,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (120 of 137 remaining) [2024-11-13 16:05:35,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (119 of 137 remaining) [2024-11-13 16:05:35,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (118 of 137 remaining) [2024-11-13 16:05:35,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (117 of 137 remaining) [2024-11-13 16:05:35,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (116 of 137 remaining) [2024-11-13 16:05:35,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (115 of 137 remaining) [2024-11-13 16:05:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (114 of 137 remaining) [2024-11-13 16:05:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (113 of 137 remaining) [2024-11-13 16:05:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (112 of 137 remaining) [2024-11-13 16:05:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (111 of 137 remaining) [2024-11-13 16:05:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (110 of 137 remaining) [2024-11-13 16:05:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (109 of 137 remaining) [2024-11-13 16:05:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (108 of 137 remaining) [2024-11-13 16:05:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (107 of 137 remaining) [2024-11-13 16:05:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (106 of 137 remaining) [2024-11-13 16:05:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (105 of 137 remaining) [2024-11-13 16:05:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (104 of 137 remaining) [2024-11-13 16:05:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (103 of 137 remaining) [2024-11-13 16:05:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (102 of 137 remaining) [2024-11-13 16:05:35,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (101 of 137 remaining) [2024-11-13 16:05:35,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (100 of 137 remaining) [2024-11-13 16:05:35,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (99 of 137 remaining) [2024-11-13 16:05:35,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (98 of 137 remaining) [2024-11-13 16:05:35,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (97 of 137 remaining) [2024-11-13 16:05:35,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (96 of 137 remaining) [2024-11-13 16:05:35,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (95 of 137 remaining) [2024-11-13 16:05:35,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (94 of 137 remaining) [2024-11-13 16:05:35,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (93 of 137 remaining) [2024-11-13 16:05:35,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (92 of 137 remaining) [2024-11-13 16:05:35,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (91 of 137 remaining) [2024-11-13 16:05:35,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (90 of 137 remaining) [2024-11-13 16:05:35,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (89 of 137 remaining) [2024-11-13 16:05:35,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (88 of 137 remaining) [2024-11-13 16:05:35,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (87 of 137 remaining) [2024-11-13 16:05:35,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (86 of 137 remaining) [2024-11-13 16:05:35,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (85 of 137 remaining) [2024-11-13 16:05:35,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (84 of 137 remaining) [2024-11-13 16:05:35,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (83 of 137 remaining) [2024-11-13 16:05:35,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (82 of 137 remaining) [2024-11-13 16:05:35,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (81 of 137 remaining) [2024-11-13 16:05:35,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (80 of 137 remaining) [2024-11-13 16:05:35,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (79 of 137 remaining) [2024-11-13 16:05:35,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (78 of 137 remaining) [2024-11-13 16:05:35,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (77 of 137 remaining) [2024-11-13 16:05:35,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (76 of 137 remaining) [2024-11-13 16:05:35,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (75 of 137 remaining) [2024-11-13 16:05:35,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (74 of 137 remaining) [2024-11-13 16:05:35,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (73 of 137 remaining) [2024-11-13 16:05:35,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (72 of 137 remaining) [2024-11-13 16:05:35,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (71 of 137 remaining) [2024-11-13 16:05:35,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (70 of 137 remaining) [2024-11-13 16:05:35,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (69 of 137 remaining) [2024-11-13 16:05:35,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (68 of 137 remaining) [2024-11-13 16:05:35,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (67 of 137 remaining) [2024-11-13 16:05:35,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (66 of 137 remaining) [2024-11-13 16:05:35,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (65 of 137 remaining) [2024-11-13 16:05:35,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (64 of 137 remaining) [2024-11-13 16:05:35,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (63 of 137 remaining) [2024-11-13 16:05:35,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (62 of 137 remaining) [2024-11-13 16:05:35,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (61 of 137 remaining) [2024-11-13 16:05:35,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (60 of 137 remaining) [2024-11-13 16:05:35,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 137 remaining) [2024-11-13 16:05:35,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 137 remaining) [2024-11-13 16:05:35,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 137 remaining) [2024-11-13 16:05:35,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (56 of 137 remaining) [2024-11-13 16:05:35,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (55 of 137 remaining) [2024-11-13 16:05:35,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (54 of 137 remaining) [2024-11-13 16:05:35,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (53 of 137 remaining) [2024-11-13 16:05:35,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (52 of 137 remaining) [2024-11-13 16:05:35,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (51 of 137 remaining) [2024-11-13 16:05:35,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 137 remaining) [2024-11-13 16:05:35,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (49 of 137 remaining) [2024-11-13 16:05:35,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (48 of 137 remaining) [2024-11-13 16:05:35,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (47 of 137 remaining) [2024-11-13 16:05:35,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (46 of 137 remaining) [2024-11-13 16:05:35,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 137 remaining) [2024-11-13 16:05:35,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 137 remaining) [2024-11-13 16:05:35,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 137 remaining) [2024-11-13 16:05:35,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (42 of 137 remaining) [2024-11-13 16:05:35,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (41 of 137 remaining) [2024-11-13 16:05:35,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (40 of 137 remaining) [2024-11-13 16:05:35,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (39 of 137 remaining) [2024-11-13 16:05:35,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (38 of 137 remaining) [2024-11-13 16:05:35,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (37 of 137 remaining) [2024-11-13 16:05:35,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (36 of 137 remaining) [2024-11-13 16:05:35,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (35 of 137 remaining) [2024-11-13 16:05:35,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (34 of 137 remaining) [2024-11-13 16:05:35,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (33 of 137 remaining) [2024-11-13 16:05:35,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (32 of 137 remaining) [2024-11-13 16:05:35,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (31 of 137 remaining) [2024-11-13 16:05:35,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (30 of 137 remaining) [2024-11-13 16:05:35,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (29 of 137 remaining) [2024-11-13 16:05:35,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (28 of 137 remaining) [2024-11-13 16:05:35,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (27 of 137 remaining) [2024-11-13 16:05:35,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (26 of 137 remaining) [2024-11-13 16:05:35,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (25 of 137 remaining) [2024-11-13 16:05:35,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (24 of 137 remaining) [2024-11-13 16:05:35,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (23 of 137 remaining) [2024-11-13 16:05:35,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (22 of 137 remaining) [2024-11-13 16:05:35,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 137 remaining) [2024-11-13 16:05:35,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (20 of 137 remaining) [2024-11-13 16:05:35,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (19 of 137 remaining) [2024-11-13 16:05:35,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (18 of 137 remaining) [2024-11-13 16:05:35,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (17 of 137 remaining) [2024-11-13 16:05:35,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 137 remaining) [2024-11-13 16:05:35,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 137 remaining) [2024-11-13 16:05:35,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (14 of 137 remaining) [2024-11-13 16:05:35,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 137 remaining) [2024-11-13 16:05:35,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (12 of 137 remaining) [2024-11-13 16:05:35,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (11 of 137 remaining) [2024-11-13 16:05:35,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (10 of 137 remaining) [2024-11-13 16:05:35,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 137 remaining) [2024-11-13 16:05:35,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (8 of 137 remaining) [2024-11-13 16:05:35,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (7 of 137 remaining) [2024-11-13 16:05:35,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 137 remaining) [2024-11-13 16:05:35,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (5 of 137 remaining) [2024-11-13 16:05:35,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 137 remaining) [2024-11-13 16:05:35,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (3 of 137 remaining) [2024-11-13 16:05:35,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (2 of 137 remaining) [2024-11-13 16:05:35,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (1 of 137 remaining) [2024-11-13 16:05:35,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (0 of 137 remaining) [2024-11-13 16:05:35,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-13 16:05:35,804 INFO L407 BasicCegarLoop]: Path program 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:05:35,811 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 16:05:35,811 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:05:35,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:05:35 BasicIcfg [2024-11-13 16:05:35,822 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:05:35,823 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:05:35,824 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:05:35,824 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:05:35,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:03:53" (3/4) ... [2024-11-13 16:05:35,829 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 16:05:35,833 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-13 16:05:35,833 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-13 16:05:35,833 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-13 16:05:35,842 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-11-13 16:05:35,843 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 16:05:35,844 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 16:05:35,844 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 16:05:35,960 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 16:05:35,960 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 16:05:35,960 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:05:35,961 INFO L158 Benchmark]: Toolchain (without parser) took 105082.65ms. Allocated memory was 117.4MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 92.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2024-11-13 16:05:35,961 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:05:35,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.10ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 78.0MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:05:35,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.06ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 75.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:05:35,963 INFO L158 Benchmark]: Boogie Preprocessor took 96.44ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 72.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:05:35,964 INFO L158 Benchmark]: RCFGBuilder took 1842.59ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 80.4MB in the end (delta: -7.8MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2024-11-13 16:05:35,964 INFO L158 Benchmark]: TraceAbstraction took 102452.21ms. Allocated memory was 117.4MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 79.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2024-11-13 16:05:35,965 INFO L158 Benchmark]: Witness Printer took 137.23ms. Allocated memory is still 5.1GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:05:35,966 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.10ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 78.0MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.06ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 75.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 96.44ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 72.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1842.59ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 80.4MB in the end (delta: -7.8MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * TraceAbstraction took 102452.21ms. Allocated memory was 117.4MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 79.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. * Witness Printer took 137.23ms. Allocated memory is still 5.1GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 950 locations, 137 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 102.1s, OverallIterations: 46, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 90.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7065 SdHoareTripleChecker+Valid, 13.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4405 mSDsluCounter, 7503 SdHoareTripleChecker+Invalid, 11.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6677 mSDsCounter, 1352 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11080 IncrementalHoareTripleChecker+Invalid, 12432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1352 mSolverCounterUnsat, 826 mSDtfsCounter, 11080 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1875occurred in iteration=38, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 8464 NumberOfCodeBlocks, 8464 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 8418 ConstructedInterpolants, 0 QuantifiedInterpolants, 10504 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 PerfectInterpolantSequences, 23/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 77 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-13 16:05:36,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5809a3c-a532-411c-a1fe-d59db07d9188/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE