./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-node-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-node-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya --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 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:36:13,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:36:13,797 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 01:36:13,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:36:13,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:36:13,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:36:13,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:36:13,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:36:13,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:36:13,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:36:13,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:36:13,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:36:13,841 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:36:13,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:36:13,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:36:13,842 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:36:13,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:36:13,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:36:13,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:36:13,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:36:13,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:36:13,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:36:13,856 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 01:36:13,857 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:36:13,857 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:36:13,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:36:13,858 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:36:13,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:36:13,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:36:13,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:36:13,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:36:13,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:36:13,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:36:13,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:36:13,862 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:36:13,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:36:13,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:36:13,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:36:13,863 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:36:13,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:36:13,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:36:13,864 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 [2023-11-29 01:36:14,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:36:14,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:36:14,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:36:14,147 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:36:14,147 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:36:14,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2023-11-29 01:36:16,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:36:17,088 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:36:17,088 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2023-11-29 01:36:17,095 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/data/2438bdcab/f25f3f38a96e4b34be83a014faa35b00/FLAG54843a34f [2023-11-29 01:36:17,106 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/data/2438bdcab/f25f3f38a96e4b34be83a014faa35b00 [2023-11-29 01:36:17,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:36:17,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:36:17,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:36:17,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:36:17,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:36:17,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:36:17" (1/1) ... [2023-11-29 01:36:17,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f56ec8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:36:17, skipping insertion in model container [2023-11-29 01:36:17,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:36:17" (1/1) ... [2023-11-29 01:36:17,146 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:36:17,360 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:36:17,371 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:36:17,419 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:36:17,436 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:36:17,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:36:17 WrapperNode [2023-11-29 01:36:17,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:36:17,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:36:17,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:36:17,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:36:17,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:36:17" (1/1) ... [2023-11-29 01:36:17,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:36:17" (1/1) ... [2023-11-29 01:36:17,501 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 561 [2023-11-29 01:36:17,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:36:17,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:36:17,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:36:17,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:36:17,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:36:17" (1/1) ... [2023-11-29 01:36:17,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:36:17" (1/1) ... [2023-11-29 01:36:17,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:36:17" (1/1) ... [2023-11-29 01:36:17,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:36:17" (1/1) ... [2023-11-29 01:36:17,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:36:17" (1/1) ... [2023-11-29 01:36:17,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:36:17" (1/1) ... [2023-11-29 01:36:17,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:36:17" (1/1) ... [2023-11-29 01:36:17,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:36:17" (1/1) ... [2023-11-29 01:36:17,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:36:17,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:36:17,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:36:17,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:36:17,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:36:17" (1/1) ... [2023-11-29 01:36:17,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:36:17,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:36:17,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:36:17,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:36:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:36:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:36:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 01:36:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 01:36:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 01:36:17,634 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 01:36:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 01:36:17,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 01:36:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 01:36:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:36:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:36:17,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:36:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:36:17,637 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 01:36:17,772 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:36:17,775 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:36:18,632 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:36:18,653 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:36:18,653 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 01:36:18,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:36:18 BoogieIcfgContainer [2023-11-29 01:36:18,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:36:18,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:36:18,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:36:18,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:36:18,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:36:17" (1/3) ... [2023-11-29 01:36:18,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e2e4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:36:18, skipping insertion in model container [2023-11-29 01:36:18,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:36:17" (2/3) ... [2023-11-29 01:36:18,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e2e4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:36:18, skipping insertion in model container [2023-11-29 01:36:18,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:36:18" (3/3) ... [2023-11-29 01:36:18,664 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2023-11-29 01:36:18,673 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 01:36:18,685 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:36:18,686 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2023-11-29 01:36:18,686 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 01:36:18,820 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 01:36:18,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 709 places, 735 transitions, 1484 flow [2023-11-29 01:36:19,203 INFO L124 PetriNetUnfolderBase]: 33/733 cut-off events. [2023-11-29 01:36:19,203 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 01:36:19,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 733 events. 33/733 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1168 event pairs, 0 based on Foata normal form. 0/620 useless extension candidates. Maximal degree in co-relation 519. Up to 2 conditions per place. [2023-11-29 01:36:19,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 709 places, 735 transitions, 1484 flow [2023-11-29 01:36:19,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 683 places, 707 transitions, 1426 flow [2023-11-29 01:36:19,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:36:19,244 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@6a409492, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:36:19,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 132 error locations. [2023-11-29 01:36:19,248 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 01:36:19,248 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2023-11-29 01:36:19,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:36:19,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:19,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:19,249 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:19,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:19,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1037322181, now seen corresponding path program 1 times [2023-11-29 01:36:19,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:19,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142458025] [2023-11-29 01:36:19,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:19,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:19,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:19,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142458025] [2023-11-29 01:36:19,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142458025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:19,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:19,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:19,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550899033] [2023-11-29 01:36:19,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:19,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:19,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:19,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:19,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:19,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 693 out of 735 [2023-11-29 01:36:19,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 707 transitions, 1426 flow. Second operand has 3 states, 3 states have (on average 694.3333333333334) internal successors, (2083), 3 states have internal predecessors, (2083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:19,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:19,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 693 of 735 [2023-11-29 01:36:19,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:19,965 INFO L124 PetriNetUnfolderBase]: 39/1317 cut-off events. [2023-11-29 01:36:19,966 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-29 01:36:19,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 1317 events. 39/1317 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5348 event pairs, 15 based on Foata normal form. 33/1122 useless extension candidates. Maximal degree in co-relation 956. Up to 48 conditions per place. [2023-11-29 01:36:19,987 INFO L140 encePairwiseOnDemand]: 713/735 looper letters, 17 selfloop transitions, 2 changer transitions 11/687 dead transitions. [2023-11-29 01:36:19,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 687 transitions, 1424 flow [2023-11-29 01:36:19,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2118 transitions. [2023-11-29 01:36:20,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9605442176870749 [2023-11-29 01:36:20,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2118 transitions. [2023-11-29 01:36:20,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2118 transitions. [2023-11-29 01:36:20,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:20,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2118 transitions. [2023-11-29 01:36:20,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 706.0) internal successors, (2118), 3 states have internal predecessors, (2118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:20,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:20,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:20,045 INFO L175 Difference]: Start difference. First operand has 683 places, 707 transitions, 1426 flow. Second operand 3 states and 2118 transitions. [2023-11-29 01:36:20,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 687 transitions, 1424 flow [2023-11-29 01:36:20,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 687 transitions, 1416 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 01:36:20,070 INFO L231 Difference]: Finished difference. Result has 680 places, 676 transitions, 1360 flow [2023-11-29 01:36:20,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1378, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1360, PETRI_PLACES=680, PETRI_TRANSITIONS=676} [2023-11-29 01:36:20,078 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -3 predicate places. [2023-11-29 01:36:20,078 INFO L495 AbstractCegarLoop]: Abstraction has has 680 places, 676 transitions, 1360 flow [2023-11-29 01:36:20,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 694.3333333333334) internal successors, (2083), 3 states have internal predecessors, (2083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:20,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:20,080 INFO L208 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] [2023-11-29 01:36:20,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:36:20,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:20,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:20,081 INFO L85 PathProgramCache]: Analyzing trace with hash -608275552, now seen corresponding path program 1 times [2023-11-29 01:36:20,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:20,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468998791] [2023-11-29 01:36:20,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:20,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:20,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:20,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468998791] [2023-11-29 01:36:20,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468998791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:20,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:20,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:20,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694724251] [2023-11-29 01:36:20,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:20,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:20,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:20,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:20,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:20,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 679 out of 735 [2023-11-29 01:36:20,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 676 transitions, 1360 flow. Second operand has 3 states, 3 states have (on average 680.0) internal successors, (2040), 3 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:20,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:20,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 679 of 735 [2023-11-29 01:36:20,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:20,868 INFO L124 PetriNetUnfolderBase]: 97/2084 cut-off events. [2023-11-29 01:36:20,868 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-29 01:36:20,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 2084 events. 97/2084 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 12064 event pairs, 48 based on Foata normal form. 0/1744 useless extension candidates. Maximal degree in co-relation 2187. Up to 125 conditions per place. [2023-11-29 01:36:20,891 INFO L140 encePairwiseOnDemand]: 724/735 looper letters, 24 selfloop transitions, 1 changer transitions 0/666 dead transitions. [2023-11-29 01:36:20,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 666 transitions, 1390 flow [2023-11-29 01:36:20,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2072 transitions. [2023-11-29 01:36:20,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9396825396825397 [2023-11-29 01:36:20,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2072 transitions. [2023-11-29 01:36:20,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2072 transitions. [2023-11-29 01:36:20,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:20,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2072 transitions. [2023-11-29 01:36:20,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 690.6666666666666) internal successors, (2072), 3 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:20,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:20,919 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:20,919 INFO L175 Difference]: Start difference. First operand has 680 places, 676 transitions, 1360 flow. Second operand 3 states and 2072 transitions. [2023-11-29 01:36:20,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 666 transitions, 1390 flow [2023-11-29 01:36:20,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 666 transitions, 1386 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:20,935 INFO L231 Difference]: Finished difference. Result has 659 places, 666 transitions, 1338 flow [2023-11-29 01:36:20,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1338, PETRI_PLACES=659, PETRI_TRANSITIONS=666} [2023-11-29 01:36:20,937 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -24 predicate places. [2023-11-29 01:36:20,937 INFO L495 AbstractCegarLoop]: Abstraction has has 659 places, 666 transitions, 1338 flow [2023-11-29 01:36:20,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 680.0) internal successors, (2040), 3 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:20,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:20,940 INFO L208 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] [2023-11-29 01:36:20,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:36:20,940 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:20,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:20,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1029899998, now seen corresponding path program 1 times [2023-11-29 01:36:20,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:20,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531594420] [2023-11-29 01:36:20,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:20,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:21,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:21,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531594420] [2023-11-29 01:36:21,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531594420] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:21,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:21,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:21,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853863520] [2023-11-29 01:36:21,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:21,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:21,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:21,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:21,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:21,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 693 out of 735 [2023-11-29 01:36:21,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 666 transitions, 1338 flow. Second operand has 3 states, 3 states have (on average 694.3333333333334) internal successors, (2083), 3 states have internal predecessors, (2083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:21,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:21,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 693 of 735 [2023-11-29 01:36:21,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:21,315 INFO L124 PetriNetUnfolderBase]: 39/1298 cut-off events. [2023-11-29 01:36:21,315 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2023-11-29 01:36:21,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 1298 events. 39/1298 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5129 event pairs, 15 based on Foata normal form. 0/1097 useless extension candidates. Maximal degree in co-relation 1320. Up to 48 conditions per place. [2023-11-29 01:36:21,326 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 17 selfloop transitions, 2 changer transitions 0/665 dead transitions. [2023-11-29 01:36:21,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 665 transitions, 1374 flow [2023-11-29 01:36:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2099 transitions. [2023-11-29 01:36:21,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9519274376417234 [2023-11-29 01:36:21,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2099 transitions. [2023-11-29 01:36:21,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2099 transitions. [2023-11-29 01:36:21,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:21,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2099 transitions. [2023-11-29 01:36:21,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 699.6666666666666) internal successors, (2099), 3 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:21,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:21,346 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:21,346 INFO L175 Difference]: Start difference. First operand has 659 places, 666 transitions, 1338 flow. Second operand 3 states and 2099 transitions. [2023-11-29 01:36:21,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 665 transitions, 1374 flow [2023-11-29 01:36:21,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 665 transitions, 1373 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:36:21,356 INFO L231 Difference]: Finished difference. Result has 659 places, 665 transitions, 1339 flow [2023-11-29 01:36:21,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1339, PETRI_PLACES=659, PETRI_TRANSITIONS=665} [2023-11-29 01:36:21,358 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -24 predicate places. [2023-11-29 01:36:21,358 INFO L495 AbstractCegarLoop]: Abstraction has has 659 places, 665 transitions, 1339 flow [2023-11-29 01:36:21,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 694.3333333333334) internal successors, (2083), 3 states have internal predecessors, (2083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:21,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:21,360 INFO L208 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] [2023-11-29 01:36:21,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:36:21,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:21,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash -842945145, now seen corresponding path program 1 times [2023-11-29 01:36:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:21,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799786075] [2023-11-29 01:36:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:21,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:21,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799786075] [2023-11-29 01:36:21,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799786075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:21,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:21,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:21,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857343772] [2023-11-29 01:36:21,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:21,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:21,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:21,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:21,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:21,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 679 out of 735 [2023-11-29 01:36:21,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 665 transitions, 1339 flow. Second operand has 3 states, 3 states have (on average 680.0) internal successors, (2040), 3 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:21,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:21,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 679 of 735 [2023-11-29 01:36:21,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:21,859 INFO L124 PetriNetUnfolderBase]: 98/2072 cut-off events. [2023-11-29 01:36:21,859 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 01:36:21,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2214 conditions, 2072 events. 98/2072 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11751 event pairs, 48 based on Foata normal form. 0/1765 useless extension candidates. Maximal degree in co-relation 2179. Up to 127 conditions per place. [2023-11-29 01:36:21,878 INFO L140 encePairwiseOnDemand]: 724/735 looper letters, 24 selfloop transitions, 1 changer transitions 0/655 dead transitions. [2023-11-29 01:36:21,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 655 transitions, 1369 flow [2023-11-29 01:36:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2072 transitions. [2023-11-29 01:36:21,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9396825396825397 [2023-11-29 01:36:21,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2072 transitions. [2023-11-29 01:36:21,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2072 transitions. [2023-11-29 01:36:21,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:21,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2072 transitions. [2023-11-29 01:36:21,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 690.6666666666666) internal successors, (2072), 3 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:21,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:21,896 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:21,897 INFO L175 Difference]: Start difference. First operand has 659 places, 665 transitions, 1339 flow. Second operand 3 states and 2072 transitions. [2023-11-29 01:36:21,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 655 transitions, 1369 flow [2023-11-29 01:36:21,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 655 transitions, 1365 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:21,906 INFO L231 Difference]: Finished difference. Result has 649 places, 655 transitions, 1317 flow [2023-11-29 01:36:21,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=649, PETRI_TRANSITIONS=655} [2023-11-29 01:36:21,908 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -34 predicate places. [2023-11-29 01:36:21,909 INFO L495 AbstractCegarLoop]: Abstraction has has 649 places, 655 transitions, 1317 flow [2023-11-29 01:36:21,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 680.0) internal successors, (2040), 3 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:21,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:21,910 INFO L208 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] [2023-11-29 01:36:21,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:36:21,911 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:21,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:21,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1392094044, now seen corresponding path program 1 times [2023-11-29 01:36:21,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:21,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433322282] [2023-11-29 01:36:21,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:21,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:21,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433322282] [2023-11-29 01:36:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433322282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:21,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:21,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502524145] [2023-11-29 01:36:21,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:21,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:21,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:21,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:21,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:22,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 700 out of 735 [2023-11-29 01:36:22,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 655 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 701.3333333333334) internal successors, (2104), 3 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:22,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 700 of 735 [2023-11-29 01:36:22,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:22,136 INFO L124 PetriNetUnfolderBase]: 16/810 cut-off events. [2023-11-29 01:36:22,136 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2023-11-29 01:36:22,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 810 events. 16/810 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1506 event pairs, 1 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 796. Up to 13 conditions per place. [2023-11-29 01:36:22,146 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 10 selfloop transitions, 2 changer transitions 0/654 dead transitions. [2023-11-29 01:36:22,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 654 transitions, 1339 flow [2023-11-29 01:36:22,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:22,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2113 transitions. [2023-11-29 01:36:22,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9582766439909297 [2023-11-29 01:36:22,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2113 transitions. [2023-11-29 01:36:22,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2113 transitions. [2023-11-29 01:36:22,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:22,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2113 transitions. [2023-11-29 01:36:22,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 704.3333333333334) internal successors, (2113), 3 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,169 INFO L175 Difference]: Start difference. First operand has 649 places, 655 transitions, 1317 flow. Second operand 3 states and 2113 transitions. [2023-11-29 01:36:22,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 654 transitions, 1339 flow [2023-11-29 01:36:22,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 654 transitions, 1338 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:36:22,183 INFO L231 Difference]: Finished difference. Result has 649 places, 654 transitions, 1318 flow [2023-11-29 01:36:22,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1318, PETRI_PLACES=649, PETRI_TRANSITIONS=654} [2023-11-29 01:36:22,186 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -34 predicate places. [2023-11-29 01:36:22,186 INFO L495 AbstractCegarLoop]: Abstraction has has 649 places, 654 transitions, 1318 flow [2023-11-29 01:36:22,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 701.3333333333334) internal successors, (2104), 3 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:22,188 INFO L208 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] [2023-11-29 01:36:22,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:36:22,188 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:22,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash -440993159, now seen corresponding path program 1 times [2023-11-29 01:36:22,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:22,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581171774] [2023-11-29 01:36:22,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:22,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:22,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581171774] [2023-11-29 01:36:22,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581171774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:22,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:22,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:22,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151216231] [2023-11-29 01:36:22,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:22,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:22,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:22,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:22,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:22,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 700 out of 735 [2023-11-29 01:36:22,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 654 transitions, 1318 flow. Second operand has 3 states, 3 states have (on average 701.3333333333334) internal successors, (2104), 3 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:22,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 700 of 735 [2023-11-29 01:36:22,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:22,492 INFO L124 PetriNetUnfolderBase]: 24/1121 cut-off events. [2023-11-29 01:36:22,492 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2023-11-29 01:36:22,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 1121 events. 24/1121 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3654 event pairs, 3 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 1115. Up to 17 conditions per place. [2023-11-29 01:36:22,505 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 10 selfloop transitions, 2 changer transitions 0/653 dead transitions. [2023-11-29 01:36:22,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 653 transitions, 1340 flow [2023-11-29 01:36:22,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2113 transitions. [2023-11-29 01:36:22,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9582766439909297 [2023-11-29 01:36:22,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2113 transitions. [2023-11-29 01:36:22,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2113 transitions. [2023-11-29 01:36:22,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:22,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2113 transitions. [2023-11-29 01:36:22,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 704.3333333333334) internal successors, (2113), 3 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,539 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,540 INFO L175 Difference]: Start difference. First operand has 649 places, 654 transitions, 1318 flow. Second operand 3 states and 2113 transitions. [2023-11-29 01:36:22,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 653 transitions, 1340 flow [2023-11-29 01:36:22,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 653 transitions, 1336 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:22,556 INFO L231 Difference]: Finished difference. Result has 648 places, 653 transitions, 1316 flow [2023-11-29 01:36:22,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1316, PETRI_PLACES=648, PETRI_TRANSITIONS=653} [2023-11-29 01:36:22,557 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -35 predicate places. [2023-11-29 01:36:22,558 INFO L495 AbstractCegarLoop]: Abstraction has has 648 places, 653 transitions, 1316 flow [2023-11-29 01:36:22,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 701.3333333333334) internal successors, (2104), 3 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:22,559 INFO L208 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] [2023-11-29 01:36:22,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:36:22,559 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:22,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:22,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1378988637, now seen corresponding path program 1 times [2023-11-29 01:36:22,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:22,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515572238] [2023-11-29 01:36:22,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:22,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:22,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:22,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515572238] [2023-11-29 01:36:22,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515572238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:22,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:22,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:22,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857690646] [2023-11-29 01:36:22,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:22,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:22,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:22,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:22,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:22,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 700 out of 735 [2023-11-29 01:36:22,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 653 transitions, 1316 flow. Second operand has 3 states, 3 states have (on average 701.3333333333334) internal successors, (2104), 3 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:22,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 700 of 735 [2023-11-29 01:36:22,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:22,845 INFO L124 PetriNetUnfolderBase]: 24/1120 cut-off events. [2023-11-29 01:36:22,845 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2023-11-29 01:36:22,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 1120 events. 24/1120 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3630 event pairs, 3 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 1114. Up to 17 conditions per place. [2023-11-29 01:36:22,854 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 10 selfloop transitions, 2 changer transitions 0/652 dead transitions. [2023-11-29 01:36:22,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 652 transitions, 1338 flow [2023-11-29 01:36:22,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2113 transitions. [2023-11-29 01:36:22,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9582766439909297 [2023-11-29 01:36:22,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2113 transitions. [2023-11-29 01:36:22,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2113 transitions. [2023-11-29 01:36:22,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:22,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2113 transitions. [2023-11-29 01:36:22,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 704.3333333333334) internal successors, (2113), 3 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,867 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,868 INFO L175 Difference]: Start difference. First operand has 648 places, 653 transitions, 1316 flow. Second operand 3 states and 2113 transitions. [2023-11-29 01:36:22,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 652 transitions, 1338 flow [2023-11-29 01:36:22,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 652 transitions, 1334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:22,877 INFO L231 Difference]: Finished difference. Result has 647 places, 652 transitions, 1314 flow [2023-11-29 01:36:22,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1314, PETRI_PLACES=647, PETRI_TRANSITIONS=652} [2023-11-29 01:36:22,879 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -36 predicate places. [2023-11-29 01:36:22,879 INFO L495 AbstractCegarLoop]: Abstraction has has 647 places, 652 transitions, 1314 flow [2023-11-29 01:36:22,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 701.3333333333334) internal successors, (2104), 3 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:22,880 INFO L208 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] [2023-11-29 01:36:22,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:36:22,880 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:22,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2130178131, now seen corresponding path program 1 times [2023-11-29 01:36:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:22,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997990996] [2023-11-29 01:36:22,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:22,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:22,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:22,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997990996] [2023-11-29 01:36:22,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997990996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:22,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:22,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:22,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092112576] [2023-11-29 01:36:22,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:22,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:22,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:22,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:22,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:22,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 700 out of 735 [2023-11-29 01:36:22,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 652 transitions, 1314 flow. Second operand has 3 states, 3 states have (on average 701.3333333333334) internal successors, (2104), 3 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:22,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 700 of 735 [2023-11-29 01:36:22,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:23,075 INFO L124 PetriNetUnfolderBase]: 13/666 cut-off events. [2023-11-29 01:36:23,076 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2023-11-29 01:36:23,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 666 events. 13/666 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1126 event pairs, 1 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 653. Up to 13 conditions per place. [2023-11-29 01:36:23,081 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 10 selfloop transitions, 2 changer transitions 0/651 dead transitions. [2023-11-29 01:36:23,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 651 transitions, 1336 flow [2023-11-29 01:36:23,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2113 transitions. [2023-11-29 01:36:23,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9582766439909297 [2023-11-29 01:36:23,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2113 transitions. [2023-11-29 01:36:23,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2113 transitions. [2023-11-29 01:36:23,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:23,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2113 transitions. [2023-11-29 01:36:23,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 704.3333333333334) internal successors, (2113), 3 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,095 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,095 INFO L175 Difference]: Start difference. First operand has 647 places, 652 transitions, 1314 flow. Second operand 3 states and 2113 transitions. [2023-11-29 01:36:23,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 651 transitions, 1336 flow [2023-11-29 01:36:23,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 646 places, 651 transitions, 1332 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:23,104 INFO L231 Difference]: Finished difference. Result has 646 places, 651 transitions, 1312 flow [2023-11-29 01:36:23,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1312, PETRI_PLACES=646, PETRI_TRANSITIONS=651} [2023-11-29 01:36:23,106 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -37 predicate places. [2023-11-29 01:36:23,106 INFO L495 AbstractCegarLoop]: Abstraction has has 646 places, 651 transitions, 1312 flow [2023-11-29 01:36:23,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 701.3333333333334) internal successors, (2104), 3 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:23,107 INFO L208 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] [2023-11-29 01:36:23,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:36:23,108 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:23,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:23,108 INFO L85 PathProgramCache]: Analyzing trace with hash -282965587, now seen corresponding path program 1 times [2023-11-29 01:36:23,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:23,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218998247] [2023-11-29 01:36:23,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:23,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:23,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:23,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218998247] [2023-11-29 01:36:23,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218998247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:23,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:23,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:23,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237789674] [2023-11-29 01:36:23,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:23,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:23,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:23,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:23,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:23,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 700 out of 735 [2023-11-29 01:36:23,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 651 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 701.3333333333334) internal successors, (2104), 3 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:23,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 700 of 735 [2023-11-29 01:36:23,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:23,323 INFO L124 PetriNetUnfolderBase]: 18/783 cut-off events. [2023-11-29 01:36:23,323 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2023-11-29 01:36:23,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 783 events. 18/783 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1484 event pairs, 3 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 774. Up to 17 conditions per place. [2023-11-29 01:36:23,331 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 10 selfloop transitions, 2 changer transitions 0/650 dead transitions. [2023-11-29 01:36:23,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 650 transitions, 1334 flow [2023-11-29 01:36:23,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2113 transitions. [2023-11-29 01:36:23,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9582766439909297 [2023-11-29 01:36:23,337 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2113 transitions. [2023-11-29 01:36:23,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2113 transitions. [2023-11-29 01:36:23,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:23,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2113 transitions. [2023-11-29 01:36:23,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 704.3333333333334) internal successors, (2113), 3 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,345 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,345 INFO L175 Difference]: Start difference. First operand has 646 places, 651 transitions, 1312 flow. Second operand 3 states and 2113 transitions. [2023-11-29 01:36:23,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 650 transitions, 1334 flow [2023-11-29 01:36:23,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 650 transitions, 1330 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:23,355 INFO L231 Difference]: Finished difference. Result has 645 places, 650 transitions, 1310 flow [2023-11-29 01:36:23,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=645, PETRI_TRANSITIONS=650} [2023-11-29 01:36:23,356 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -38 predicate places. [2023-11-29 01:36:23,357 INFO L495 AbstractCegarLoop]: Abstraction has has 645 places, 650 transitions, 1310 flow [2023-11-29 01:36:23,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 701.3333333333334) internal successors, (2104), 3 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:23,358 INFO L208 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] [2023-11-29 01:36:23,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:36:23,358 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:23,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:23,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1607081592, now seen corresponding path program 1 times [2023-11-29 01:36:23,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:23,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597869593] [2023-11-29 01:36:23,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:23,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:23,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:23,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597869593] [2023-11-29 01:36:23,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597869593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:23,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:23,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:23,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257561306] [2023-11-29 01:36:23,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:23,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:23,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:23,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:23,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:23,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 700 out of 735 [2023-11-29 01:36:23,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 650 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 701.3333333333334) internal successors, (2104), 3 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:23,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 700 of 735 [2023-11-29 01:36:23,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:23,552 INFO L124 PetriNetUnfolderBase]: 18/763 cut-off events. [2023-11-29 01:36:23,552 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2023-11-29 01:36:23,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 763 events. 18/763 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1451 event pairs, 3 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 754. Up to 17 conditions per place. [2023-11-29 01:36:23,558 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 10 selfloop transitions, 2 changer transitions 0/649 dead transitions. [2023-11-29 01:36:23,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 649 transitions, 1332 flow [2023-11-29 01:36:23,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2113 transitions. [2023-11-29 01:36:23,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9582766439909297 [2023-11-29 01:36:23,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2113 transitions. [2023-11-29 01:36:23,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2113 transitions. [2023-11-29 01:36:23,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:23,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2113 transitions. [2023-11-29 01:36:23,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 704.3333333333334) internal successors, (2113), 3 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,573 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,573 INFO L175 Difference]: Start difference. First operand has 645 places, 650 transitions, 1310 flow. Second operand 3 states and 2113 transitions. [2023-11-29 01:36:23,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 649 transitions, 1332 flow [2023-11-29 01:36:23,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 649 transitions, 1328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:23,582 INFO L231 Difference]: Finished difference. Result has 644 places, 649 transitions, 1308 flow [2023-11-29 01:36:23,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1308, PETRI_PLACES=644, PETRI_TRANSITIONS=649} [2023-11-29 01:36:23,584 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -39 predicate places. [2023-11-29 01:36:23,584 INFO L495 AbstractCegarLoop]: Abstraction has has 644 places, 649 transitions, 1308 flow [2023-11-29 01:36:23,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 701.3333333333334) internal successors, (2104), 3 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:23,585 INFO L208 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] [2023-11-29 01:36:23,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:36:23,586 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:23,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:23,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1096881656, now seen corresponding path program 1 times [2023-11-29 01:36:23,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:23,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786082530] [2023-11-29 01:36:23,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:23,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:23,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:23,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786082530] [2023-11-29 01:36:23,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786082530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:23,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:23,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:23,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130749226] [2023-11-29 01:36:23,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:23,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:23,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:23,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:23,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:23,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 699 out of 735 [2023-11-29 01:36:23,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 649 transitions, 1308 flow. Second operand has 3 states, 3 states have (on average 700.3333333333334) internal successors, (2101), 3 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:23,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 699 of 735 [2023-11-29 01:36:23,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:23,842 INFO L124 PetriNetUnfolderBase]: 29/1106 cut-off events. [2023-11-29 01:36:23,842 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 01:36:23,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 1106 events. 29/1106 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3828 event pairs, 8 based on Foata normal form. 0/963 useless extension candidates. Maximal degree in co-relation 1110. Up to 28 conditions per place. [2023-11-29 01:36:23,852 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 11 selfloop transitions, 2 changer transitions 0/648 dead transitions. [2023-11-29 01:36:23,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 648 transitions, 1332 flow [2023-11-29 01:36:23,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2111 transitions. [2023-11-29 01:36:23,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9573696145124716 [2023-11-29 01:36:23,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2111 transitions. [2023-11-29 01:36:23,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2111 transitions. [2023-11-29 01:36:23,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:23,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2111 transitions. [2023-11-29 01:36:23,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 703.6666666666666) internal successors, (2111), 3 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,867 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,867 INFO L175 Difference]: Start difference. First operand has 644 places, 649 transitions, 1308 flow. Second operand 3 states and 2111 transitions. [2023-11-29 01:36:23,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 648 transitions, 1332 flow [2023-11-29 01:36:23,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 648 transitions, 1328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:23,877 INFO L231 Difference]: Finished difference. Result has 643 places, 648 transitions, 1306 flow [2023-11-29 01:36:23,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=643, PETRI_TRANSITIONS=648} [2023-11-29 01:36:23,878 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -40 predicate places. [2023-11-29 01:36:23,878 INFO L495 AbstractCegarLoop]: Abstraction has has 643 places, 648 transitions, 1306 flow [2023-11-29 01:36:23,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 700.3333333333334) internal successors, (2101), 3 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:23,879 INFO L208 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] [2023-11-29 01:36:23,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 01:36:23,879 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:23,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:23,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1726108628, now seen corresponding path program 1 times [2023-11-29 01:36:23,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:23,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162133287] [2023-11-29 01:36:23,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:23,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:24,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:24,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162133287] [2023-11-29 01:36:24,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162133287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:24,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:24,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:36:24,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625845304] [2023-11-29 01:36:24,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:24,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:36:24,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:24,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:36:24,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:36:24,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 636 out of 735 [2023-11-29 01:36:24,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 648 transitions, 1306 flow. Second operand has 6 states, 6 states have (on average 637.5) internal successors, (3825), 6 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:24,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:24,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 636 of 735 [2023-11-29 01:36:24,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:28,766 INFO L124 PetriNetUnfolderBase]: 3466/19867 cut-off events. [2023-11-29 01:36:28,766 INFO L125 PetriNetUnfolderBase]: For 33/36 co-relation queries the response was YES. [2023-11-29 01:36:28,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25023 conditions, 19867 events. 3466/19867 cut-off events. For 33/36 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 227413 event pairs, 3168 based on Foata normal form. 0/17217 useless extension candidates. Maximal degree in co-relation 24988. Up to 5120 conditions per place. [2023-11-29 01:36:28,891 INFO L140 encePairwiseOnDemand]: 723/735 looper letters, 66 selfloop transitions, 10 changer transitions 0/646 dead transitions. [2023-11-29 01:36:28,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 646 transitions, 1454 flow [2023-11-29 01:36:28,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:36:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:36:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3894 transitions. [2023-11-29 01:36:28,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8829931972789116 [2023-11-29 01:36:28,903 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3894 transitions. [2023-11-29 01:36:28,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3894 transitions. [2023-11-29 01:36:28,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:28,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3894 transitions. [2023-11-29 01:36:28,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 649.0) internal successors, (3894), 6 states have internal predecessors, (3894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:28,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 735.0) internal successors, (5145), 7 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:28,923 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 735.0) internal successors, (5145), 7 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:28,923 INFO L175 Difference]: Start difference. First operand has 643 places, 648 transitions, 1306 flow. Second operand 6 states and 3894 transitions. [2023-11-29 01:36:28,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 646 transitions, 1454 flow [2023-11-29 01:36:28,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 646 transitions, 1450 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:28,941 INFO L231 Difference]: Finished difference. Result has 644 places, 646 transitions, 1318 flow [2023-11-29 01:36:28,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1318, PETRI_PLACES=644, PETRI_TRANSITIONS=646} [2023-11-29 01:36:28,944 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -39 predicate places. [2023-11-29 01:36:28,944 INFO L495 AbstractCegarLoop]: Abstraction has has 644 places, 646 transitions, 1318 flow [2023-11-29 01:36:28,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 637.5) internal successors, (3825), 6 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:28,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:28,946 INFO L208 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] [2023-11-29 01:36:28,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 01:36:28,947 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:28,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:28,948 INFO L85 PathProgramCache]: Analyzing trace with hash 547325939, now seen corresponding path program 1 times [2023-11-29 01:36:28,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:28,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134779489] [2023-11-29 01:36:28,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:28,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:29,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:29,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134779489] [2023-11-29 01:36:29,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134779489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:29,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:29,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:29,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650357065] [2023-11-29 01:36:29,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:29,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:29,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:29,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:29,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 699 out of 735 [2023-11-29 01:36:29,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 646 transitions, 1318 flow. Second operand has 3 states, 3 states have (on average 700.3333333333334) internal successors, (2101), 3 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:29,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:29,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 699 of 735 [2023-11-29 01:36:29,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:29,372 INFO L124 PetriNetUnfolderBase]: 29/1107 cut-off events. [2023-11-29 01:36:29,373 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2023-11-29 01:36:29,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 1107 events. 29/1107 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3525 event pairs, 8 based on Foata normal form. 0/965 useless extension candidates. Maximal degree in co-relation 1122. Up to 28 conditions per place. [2023-11-29 01:36:29,387 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 11 selfloop transitions, 2 changer transitions 0/645 dead transitions. [2023-11-29 01:36:29,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 645 transitions, 1342 flow [2023-11-29 01:36:29,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2111 transitions. [2023-11-29 01:36:29,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9573696145124716 [2023-11-29 01:36:29,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2111 transitions. [2023-11-29 01:36:29,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2111 transitions. [2023-11-29 01:36:29,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:29,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2111 transitions. [2023-11-29 01:36:29,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 703.6666666666666) internal successors, (2111), 3 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:29,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:29,410 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:29,410 INFO L175 Difference]: Start difference. First operand has 644 places, 646 transitions, 1318 flow. Second operand 3 states and 2111 transitions. [2023-11-29 01:36:29,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 645 transitions, 1342 flow [2023-11-29 01:36:29,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 645 transitions, 1322 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:36:29,428 INFO L231 Difference]: Finished difference. Result has 640 places, 645 transitions, 1300 flow [2023-11-29 01:36:29,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1300, PETRI_PLACES=640, PETRI_TRANSITIONS=645} [2023-11-29 01:36:29,430 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -43 predicate places. [2023-11-29 01:36:29,430 INFO L495 AbstractCegarLoop]: Abstraction has has 640 places, 645 transitions, 1300 flow [2023-11-29 01:36:29,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 700.3333333333334) internal successors, (2101), 3 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:29,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:29,431 INFO L208 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] [2023-11-29 01:36:29,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 01:36:29,432 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:29,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:29,432 INFO L85 PathProgramCache]: Analyzing trace with hash -288778113, now seen corresponding path program 1 times [2023-11-29 01:36:29,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:29,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180296840] [2023-11-29 01:36:29,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:29,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:29,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:29,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180296840] [2023-11-29 01:36:29,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180296840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:29,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:29,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:29,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789530953] [2023-11-29 01:36:29,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:29,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:29,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:29,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:29,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:29,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 636 out of 735 [2023-11-29 01:36:29,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 645 transitions, 1300 flow. Second operand has 3 states, 3 states have (on average 638.0) internal successors, (1914), 3 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:29,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:29,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 636 of 735 [2023-11-29 01:36:29,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:33,449 INFO L124 PetriNetUnfolderBase]: 3466/19864 cut-off events. [2023-11-29 01:36:33,449 INFO L125 PetriNetUnfolderBase]: For 33/36 co-relation queries the response was YES. [2023-11-29 01:36:33,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25020 conditions, 19864 events. 3466/19864 cut-off events. For 33/36 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 227367 event pairs, 3168 based on Foata normal form. 0/17217 useless extension candidates. Maximal degree in co-relation 24985. Up to 5126 conditions per place. [2023-11-29 01:36:33,559 INFO L140 encePairwiseOnDemand]: 729/735 looper letters, 72 selfloop transitions, 4 changer transitions 0/643 dead transitions. [2023-11-29 01:36:33,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 643 transitions, 1448 flow [2023-11-29 01:36:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:33,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2023-11-29 01:36:33,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9006802721088435 [2023-11-29 01:36:33,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2023-11-29 01:36:33,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2023-11-29 01:36:33,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:33,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2023-11-29 01:36:33,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:33,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:33,580 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:33,580 INFO L175 Difference]: Start difference. First operand has 640 places, 645 transitions, 1300 flow. Second operand 3 states and 1986 transitions. [2023-11-29 01:36:33,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 643 transitions, 1448 flow [2023-11-29 01:36:33,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 643 transitions, 1444 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:33,596 INFO L231 Difference]: Finished difference. Result has 638 places, 643 transitions, 1300 flow [2023-11-29 01:36:33,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1300, PETRI_PLACES=638, PETRI_TRANSITIONS=643} [2023-11-29 01:36:33,598 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -45 predicate places. [2023-11-29 01:36:33,599 INFO L495 AbstractCegarLoop]: Abstraction has has 638 places, 643 transitions, 1300 flow [2023-11-29 01:36:33,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 638.0) internal successors, (1914), 3 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:33,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:33,600 INFO L208 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] [2023-11-29 01:36:33,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 01:36:33,600 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:33,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:33,601 INFO L85 PathProgramCache]: Analyzing trace with hash -119903767, now seen corresponding path program 1 times [2023-11-29 01:36:33,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:33,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471496681] [2023-11-29 01:36:33,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:33,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:33,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:33,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471496681] [2023-11-29 01:36:33,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471496681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:33,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:33,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:33,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119560254] [2023-11-29 01:36:33,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:33,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:33,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:33,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:33,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:33,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 701 out of 735 [2023-11-29 01:36:33,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 643 transitions, 1300 flow. Second operand has 3 states, 3 states have (on average 702.3333333333334) internal successors, (2107), 3 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:33,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:33,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 701 of 735 [2023-11-29 01:36:33,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:34,017 INFO L124 PetriNetUnfolderBase]: 18/809 cut-off events. [2023-11-29 01:36:34,018 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2023-11-29 01:36:34,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 809 events. 18/809 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1905 event pairs, 3 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 817. Up to 16 conditions per place. [2023-11-29 01:36:34,027 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 9 selfloop transitions, 2 changer transitions 0/642 dead transitions. [2023-11-29 01:36:34,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 642 transitions, 1320 flow [2023-11-29 01:36:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:34,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2115 transitions. [2023-11-29 01:36:34,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9591836734693877 [2023-11-29 01:36:34,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2115 transitions. [2023-11-29 01:36:34,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2115 transitions. [2023-11-29 01:36:34,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:34,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2115 transitions. [2023-11-29 01:36:34,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 705.0) internal successors, (2115), 3 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:34,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:34,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:34,043 INFO L175 Difference]: Start difference. First operand has 638 places, 643 transitions, 1300 flow. Second operand 3 states and 2115 transitions. [2023-11-29 01:36:34,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 642 transitions, 1320 flow [2023-11-29 01:36:34,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 642 transitions, 1312 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:34,056 INFO L231 Difference]: Finished difference. Result has 637 places, 642 transitions, 1294 flow [2023-11-29 01:36:34,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1294, PETRI_PLACES=637, PETRI_TRANSITIONS=642} [2023-11-29 01:36:34,058 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -46 predicate places. [2023-11-29 01:36:34,058 INFO L495 AbstractCegarLoop]: Abstraction has has 637 places, 642 transitions, 1294 flow [2023-11-29 01:36:34,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 702.3333333333334) internal successors, (2107), 3 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:34,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:34,060 INFO L208 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] [2023-11-29 01:36:34,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 01:36:34,060 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:34,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:34,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2090331862, now seen corresponding path program 1 times [2023-11-29 01:36:34,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:34,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092813438] [2023-11-29 01:36:34,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:34,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:34,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:34,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092813438] [2023-11-29 01:36:34,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092813438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:34,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:34,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:34,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597933102] [2023-11-29 01:36:34,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:34,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:34,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:34,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:34,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:34,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 701 out of 735 [2023-11-29 01:36:34,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 642 transitions, 1294 flow. Second operand has 3 states, 3 states have (on average 702.3333333333334) internal successors, (2107), 3 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:34,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:34,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 701 of 735 [2023-11-29 01:36:34,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:34,352 INFO L124 PetriNetUnfolderBase]: 21/905 cut-off events. [2023-11-29 01:36:34,352 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2023-11-29 01:36:34,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 905 events. 21/905 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2142 event pairs, 3 based on Foata normal form. 0/800 useless extension candidates. Maximal degree in co-relation 896. Up to 16 conditions per place. [2023-11-29 01:36:34,363 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 9 selfloop transitions, 2 changer transitions 0/641 dead transitions. [2023-11-29 01:36:34,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 641 transitions, 1314 flow [2023-11-29 01:36:34,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2115 transitions. [2023-11-29 01:36:34,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9591836734693877 [2023-11-29 01:36:34,369 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2115 transitions. [2023-11-29 01:36:34,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2115 transitions. [2023-11-29 01:36:34,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:34,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2115 transitions. [2023-11-29 01:36:34,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 705.0) internal successors, (2115), 3 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:34,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:34,377 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:34,377 INFO L175 Difference]: Start difference. First operand has 637 places, 642 transitions, 1294 flow. Second operand 3 states and 2115 transitions. [2023-11-29 01:36:34,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 641 transitions, 1314 flow [2023-11-29 01:36:34,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 641 transitions, 1310 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:34,391 INFO L231 Difference]: Finished difference. Result has 636 places, 641 transitions, 1292 flow [2023-11-29 01:36:34,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1292, PETRI_PLACES=636, PETRI_TRANSITIONS=641} [2023-11-29 01:36:34,392 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -47 predicate places. [2023-11-29 01:36:34,392 INFO L495 AbstractCegarLoop]: Abstraction has has 636 places, 641 transitions, 1292 flow [2023-11-29 01:36:34,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 702.3333333333334) internal successors, (2107), 3 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:34,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:34,393 INFO L208 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] [2023-11-29 01:36:34,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 01:36:34,394 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:34,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:34,394 INFO L85 PathProgramCache]: Analyzing trace with hash -469335129, now seen corresponding path program 1 times [2023-11-29 01:36:34,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:34,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865700366] [2023-11-29 01:36:34,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:34,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:34,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:34,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865700366] [2023-11-29 01:36:34,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865700366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:34,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:34,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:34,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905818886] [2023-11-29 01:36:34,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:34,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:34,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:34,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:34,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:34,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 697 out of 735 [2023-11-29 01:36:34,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 641 transitions, 1292 flow. Second operand has 3 states, 3 states have (on average 698.3333333333334) internal successors, (2095), 3 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:34,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:34,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 697 of 735 [2023-11-29 01:36:34,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:34,844 INFO L124 PetriNetUnfolderBase]: 57/1651 cut-off events. [2023-11-29 01:36:34,844 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-29 01:36:34,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1728 conditions, 1651 events. 57/1651 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7830 event pairs, 19 based on Foata normal form. 0/1445 useless extension candidates. Maximal degree in co-relation 1693. Up to 61 conditions per place. [2023-11-29 01:36:34,858 INFO L140 encePairwiseOnDemand]: 729/735 looper letters, 14 selfloop transitions, 2 changer transitions 0/640 dead transitions. [2023-11-29 01:36:34,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 640 transitions, 1323 flow [2023-11-29 01:36:34,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2111 transitions. [2023-11-29 01:36:34,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9573696145124716 [2023-11-29 01:36:34,864 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2111 transitions. [2023-11-29 01:36:34,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2111 transitions. [2023-11-29 01:36:34,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:34,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2111 transitions. [2023-11-29 01:36:34,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 703.6666666666666) internal successors, (2111), 3 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:34,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:34,872 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:34,872 INFO L175 Difference]: Start difference. First operand has 636 places, 641 transitions, 1292 flow. Second operand 3 states and 2111 transitions. [2023-11-29 01:36:34,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 640 transitions, 1323 flow [2023-11-29 01:36:34,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 640 transitions, 1319 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:34,885 INFO L231 Difference]: Finished difference. Result has 633 places, 639 transitions, 1294 flow [2023-11-29 01:36:34,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1294, PETRI_PLACES=633, PETRI_TRANSITIONS=639} [2023-11-29 01:36:34,887 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -50 predicate places. [2023-11-29 01:36:34,887 INFO L495 AbstractCegarLoop]: Abstraction has has 633 places, 639 transitions, 1294 flow [2023-11-29 01:36:34,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 698.3333333333334) internal successors, (2095), 3 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:34,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:34,888 INFO L208 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] [2023-11-29 01:36:34,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 01:36:34,888 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:34,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:34,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1854173168, now seen corresponding path program 1 times [2023-11-29 01:36:34,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:34,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518669240] [2023-11-29 01:36:34,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:34,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:34,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:34,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518669240] [2023-11-29 01:36:34,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518669240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:34,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:34,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:34,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055633793] [2023-11-29 01:36:34,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:34,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:34,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:34,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:34,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:34,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 697 out of 735 [2023-11-29 01:36:35,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 639 transitions, 1294 flow. Second operand has 3 states, 3 states have (on average 698.6666666666666) internal successors, (2096), 3 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:35,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:35,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 697 of 735 [2023-11-29 01:36:35,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:35,347 INFO L124 PetriNetUnfolderBase]: 57/1671 cut-off events. [2023-11-29 01:36:35,347 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 01:36:35,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 1671 events. 57/1671 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 8213 event pairs, 15 based on Foata normal form. 0/1481 useless extension candidates. Maximal degree in co-relation 1719. Up to 62 conditions per place. [2023-11-29 01:36:35,357 INFO L140 encePairwiseOnDemand]: 729/735 looper letters, 14 selfloop transitions, 2 changer transitions 0/638 dead transitions. [2023-11-29 01:36:35,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 638 transitions, 1325 flow [2023-11-29 01:36:35,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:35,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2111 transitions. [2023-11-29 01:36:35,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9573696145124716 [2023-11-29 01:36:35,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2111 transitions. [2023-11-29 01:36:35,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2111 transitions. [2023-11-29 01:36:35,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:35,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2111 transitions. [2023-11-29 01:36:35,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 703.6666666666666) internal successors, (2111), 3 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:35,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:35,371 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:35,371 INFO L175 Difference]: Start difference. First operand has 633 places, 639 transitions, 1294 flow. Second operand 3 states and 2111 transitions. [2023-11-29 01:36:35,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 638 transitions, 1325 flow [2023-11-29 01:36:35,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 638 transitions, 1325 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:36:35,387 INFO L231 Difference]: Finished difference. Result has 632 places, 637 transitions, 1300 flow [2023-11-29 01:36:35,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1300, PETRI_PLACES=632, PETRI_TRANSITIONS=637} [2023-11-29 01:36:35,389 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -51 predicate places. [2023-11-29 01:36:35,389 INFO L495 AbstractCegarLoop]: Abstraction has has 632 places, 637 transitions, 1300 flow [2023-11-29 01:36:35,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 698.6666666666666) internal successors, (2096), 3 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:35,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:35,389 INFO L208 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] [2023-11-29 01:36:35,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 01:36:35,390 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:35,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:35,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1822125773, now seen corresponding path program 1 times [2023-11-29 01:36:35,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:35,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458520829] [2023-11-29 01:36:35,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:35,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:35,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:35,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458520829] [2023-11-29 01:36:35,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458520829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:35,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:35,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:36:35,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882985882] [2023-11-29 01:36:35,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:35,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:36:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:35,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:36:35,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:36:36,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 683 out of 735 [2023-11-29 01:36:36,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 637 transitions, 1300 flow. Second operand has 7 states, 7 states have (on average 686.2857142857143) internal successors, (4804), 7 states have internal predecessors, (4804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:36,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:36,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 683 of 735 [2023-11-29 01:36:36,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:36,482 INFO L124 PetriNetUnfolderBase]: 38/1680 cut-off events. [2023-11-29 01:36:36,482 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-11-29 01:36:36,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 1680 events. 38/1680 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8097 event pairs, 0 based on Foata normal form. 1/1510 useless extension candidates. Maximal degree in co-relation 1731. Up to 29 conditions per place. [2023-11-29 01:36:36,501 INFO L140 encePairwiseOnDemand]: 725/735 looper letters, 45 selfloop transitions, 9 changer transitions 0/661 dead transitions. [2023-11-29 01:36:36,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 661 transitions, 1460 flow [2023-11-29 01:36:36,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:36:36,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 01:36:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4836 transitions. [2023-11-29 01:36:36,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9399416909620991 [2023-11-29 01:36:36,513 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 4836 transitions. [2023-11-29 01:36:36,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 4836 transitions. [2023-11-29 01:36:36,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:36,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 4836 transitions. [2023-11-29 01:36:36,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 690.8571428571429) internal successors, (4836), 7 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:36,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 735.0) internal successors, (5880), 8 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:36,529 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 735.0) internal successors, (5880), 8 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:36,529 INFO L175 Difference]: Start difference. First operand has 632 places, 637 transitions, 1300 flow. Second operand 7 states and 4836 transitions. [2023-11-29 01:36:36,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 661 transitions, 1460 flow [2023-11-29 01:36:36,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 661 transitions, 1460 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:36:36,540 INFO L231 Difference]: Finished difference. Result has 642 places, 643 transitions, 1357 flow [2023-11-29 01:36:36,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1357, PETRI_PLACES=642, PETRI_TRANSITIONS=643} [2023-11-29 01:36:36,541 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -41 predicate places. [2023-11-29 01:36:36,541 INFO L495 AbstractCegarLoop]: Abstraction has has 642 places, 643 transitions, 1357 flow [2023-11-29 01:36:36,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 686.2857142857143) internal successors, (4804), 7 states have internal predecessors, (4804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:36,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:36,542 INFO L208 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] [2023-11-29 01:36:36,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 01:36:36,542 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:36,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:36,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1685088089, now seen corresponding path program 1 times [2023-11-29 01:36:36,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:36,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913521728] [2023-11-29 01:36:36,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:36,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:37,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:37,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:37,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913521728] [2023-11-29 01:36:37,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913521728] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:37,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:37,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:36:37,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167850149] [2023-11-29 01:36:37,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:37,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:36:37,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:37,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:36:37,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:36:37,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 735 [2023-11-29 01:36:37,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 643 transitions, 1357 flow. Second operand has 6 states, 6 states have (on average 673.6666666666666) internal successors, (4042), 6 states have internal predecessors, (4042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:37,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:37,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 735 [2023-11-29 01:36:37,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:39,029 INFO L124 PetriNetUnfolderBase]: 358/5302 cut-off events. [2023-11-29 01:36:39,030 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-29 01:36:39,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5998 conditions, 5302 events. 358/5302 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 45121 event pairs, 98 based on Foata normal form. 0/4680 useless extension candidates. Maximal degree in co-relation 5954. Up to 504 conditions per place. [2023-11-29 01:36:39,066 INFO L140 encePairwiseOnDemand]: 723/735 looper letters, 54 selfloop transitions, 8 changer transitions 0/663 dead transitions. [2023-11-29 01:36:39,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 663 transitions, 1525 flow [2023-11-29 01:36:39,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:36:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:36:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4098 transitions. [2023-11-29 01:36:39,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9292517006802721 [2023-11-29 01:36:39,075 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4098 transitions. [2023-11-29 01:36:39,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4098 transitions. [2023-11-29 01:36:39,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:39,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4098 transitions. [2023-11-29 01:36:39,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 683.0) internal successors, (4098), 6 states have internal predecessors, (4098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:39,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 735.0) internal successors, (5145), 7 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:39,086 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 735.0) internal successors, (5145), 7 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:39,086 INFO L175 Difference]: Start difference. First operand has 642 places, 643 transitions, 1357 flow. Second operand 6 states and 4098 transitions. [2023-11-29 01:36:39,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 663 transitions, 1525 flow [2023-11-29 01:36:39,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 663 transitions, 1520 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:39,098 INFO L231 Difference]: Finished difference. Result has 645 places, 647 transitions, 1406 flow [2023-11-29 01:36:39,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1406, PETRI_PLACES=645, PETRI_TRANSITIONS=647} [2023-11-29 01:36:39,100 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -38 predicate places. [2023-11-29 01:36:39,100 INFO L495 AbstractCegarLoop]: Abstraction has has 645 places, 647 transitions, 1406 flow [2023-11-29 01:36:39,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 673.6666666666666) internal successors, (4042), 6 states have internal predecessors, (4042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:39,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:39,101 INFO L208 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] [2023-11-29 01:36:39,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 01:36:39,101 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:39,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:39,101 INFO L85 PathProgramCache]: Analyzing trace with hash -493737762, now seen corresponding path program 1 times [2023-11-29 01:36:39,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:39,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750658146] [2023-11-29 01:36:39,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:39,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:39,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:39,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750658146] [2023-11-29 01:36:39,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750658146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:39,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:39,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:36:39,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078221378] [2023-11-29 01:36:39,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:39,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:36:39,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:39,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:36:39,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:36:40,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 690 out of 735 [2023-11-29 01:36:40,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 647 transitions, 1406 flow. Second operand has 6 states, 6 states have (on average 691.5) internal successors, (4149), 6 states have internal predecessors, (4149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:40,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:40,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 690 of 735 [2023-11-29 01:36:40,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:40,890 INFO L124 PetriNetUnfolderBase]: 70/2580 cut-off events. [2023-11-29 01:36:40,890 INFO L125 PetriNetUnfolderBase]: For 21/49 co-relation queries the response was YES. [2023-11-29 01:36:40,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2778 conditions, 2580 events. 70/2580 cut-off events. For 21/49 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 17419 event pairs, 0 based on Foata normal form. 16/2312 useless extension candidates. Maximal degree in co-relation 2732. Up to 31 conditions per place. [2023-11-29 01:36:40,908 INFO L140 encePairwiseOnDemand]: 730/735 looper letters, 17 selfloop transitions, 4 changer transitions 0/646 dead transitions. [2023-11-29 01:36:40,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 646 transitions, 1446 flow [2023-11-29 01:36:40,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:36:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:36:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4162 transitions. [2023-11-29 01:36:40,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.943764172335601 [2023-11-29 01:36:40,919 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4162 transitions. [2023-11-29 01:36:40,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4162 transitions. [2023-11-29 01:36:40,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:40,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4162 transitions. [2023-11-29 01:36:40,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 693.6666666666666) internal successors, (4162), 6 states have internal predecessors, (4162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:40,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 735.0) internal successors, (5145), 7 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:40,930 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 735.0) internal successors, (5145), 7 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:40,930 INFO L175 Difference]: Start difference. First operand has 645 places, 647 transitions, 1406 flow. Second operand 6 states and 4162 transitions. [2023-11-29 01:36:40,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 646 transitions, 1446 flow [2023-11-29 01:36:40,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 646 transitions, 1446 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:36:40,944 INFO L231 Difference]: Finished difference. Result has 649 places, 646 transitions, 1412 flow [2023-11-29 01:36:40,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1404, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=642, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1412, PETRI_PLACES=649, PETRI_TRANSITIONS=646} [2023-11-29 01:36:40,946 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -34 predicate places. [2023-11-29 01:36:40,946 INFO L495 AbstractCegarLoop]: Abstraction has has 649 places, 646 transitions, 1412 flow [2023-11-29 01:36:40,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 691.5) internal successors, (4149), 6 states have internal predecessors, (4149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:40,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:40,947 INFO L208 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] [2023-11-29 01:36:40,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 01:36:40,947 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:40,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1607761052, now seen corresponding path program 1 times [2023-11-29 01:36:40,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:40,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820725247] [2023-11-29 01:36:40,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:40,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:41,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:41,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820725247] [2023-11-29 01:36:41,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820725247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:41,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:41,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:41,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707985750] [2023-11-29 01:36:41,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:41,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:41,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:41,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:41,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:41,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 702 out of 735 [2023-11-29 01:36:41,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 646 transitions, 1412 flow. Second operand has 3 states, 3 states have (on average 703.6666666666666) internal successors, (2111), 3 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:41,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:41,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 702 of 735 [2023-11-29 01:36:41,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:41,717 INFO L124 PetriNetUnfolderBase]: 94/3136 cut-off events. [2023-11-29 01:36:41,717 INFO L125 PetriNetUnfolderBase]: For 21/27 co-relation queries the response was YES. [2023-11-29 01:36:41,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3386 conditions, 3136 events. 94/3136 cut-off events. For 21/27 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 23635 event pairs, 8 based on Foata normal form. 0/2782 useless extension candidates. Maximal degree in co-relation 3341. Up to 40 conditions per place. [2023-11-29 01:36:41,743 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 10 selfloop transitions, 2 changer transitions 0/646 dead transitions. [2023-11-29 01:36:41,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 646 transitions, 1437 flow [2023-11-29 01:36:41,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2119 transitions. [2023-11-29 01:36:41,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9609977324263038 [2023-11-29 01:36:41,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2119 transitions. [2023-11-29 01:36:41,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2119 transitions. [2023-11-29 01:36:41,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:41,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2119 transitions. [2023-11-29 01:36:41,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 706.3333333333334) internal successors, (2119), 3 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:41,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:41,759 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:41,759 INFO L175 Difference]: Start difference. First operand has 649 places, 646 transitions, 1412 flow. Second operand 3 states and 2119 transitions. [2023-11-29 01:36:41,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 646 transitions, 1437 flow [2023-11-29 01:36:41,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 646 places, 646 transitions, 1430 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 01:36:41,777 INFO L231 Difference]: Finished difference. Result has 646 places, 645 transitions, 1407 flow [2023-11-29 01:36:41,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1407, PETRI_PLACES=646, PETRI_TRANSITIONS=645} [2023-11-29 01:36:41,779 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -37 predicate places. [2023-11-29 01:36:41,779 INFO L495 AbstractCegarLoop]: Abstraction has has 646 places, 645 transitions, 1407 flow [2023-11-29 01:36:41,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 703.6666666666666) internal successors, (2111), 3 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:41,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:41,780 INFO L208 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] [2023-11-29 01:36:41,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 01:36:41,781 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:41,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash 151715362, now seen corresponding path program 1 times [2023-11-29 01:36:41,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:41,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800123246] [2023-11-29 01:36:41,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:41,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:42,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:42,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800123246] [2023-11-29 01:36:42,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800123246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:42,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:42,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:36:42,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527217734] [2023-11-29 01:36:42,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:42,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:36:42,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:42,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:36:42,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:36:43,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 735 [2023-11-29 01:36:43,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 645 transitions, 1407 flow. Second operand has 6 states, 6 states have (on average 673.8333333333334) internal successors, (4043), 6 states have internal predecessors, (4043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:43,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:43,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 735 [2023-11-29 01:36:43,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:44,690 INFO L124 PetriNetUnfolderBase]: 380/6060 cut-off events. [2023-11-29 01:36:44,690 INFO L125 PetriNetUnfolderBase]: For 51/57 co-relation queries the response was YES. [2023-11-29 01:36:44,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6908 conditions, 6060 events. 380/6060 cut-off events. For 51/57 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 55217 event pairs, 96 based on Foata normal form. 0/5404 useless extension candidates. Maximal degree in co-relation 6861. Up to 540 conditions per place. [2023-11-29 01:36:44,717 INFO L140 encePairwiseOnDemand]: 723/735 looper letters, 54 selfloop transitions, 8 changer transitions 0/665 dead transitions. [2023-11-29 01:36:44,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 665 transitions, 1575 flow [2023-11-29 01:36:44,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:36:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:36:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4098 transitions. [2023-11-29 01:36:44,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9292517006802721 [2023-11-29 01:36:44,725 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4098 transitions. [2023-11-29 01:36:44,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4098 transitions. [2023-11-29 01:36:44,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:44,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4098 transitions. [2023-11-29 01:36:44,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 683.0) internal successors, (4098), 6 states have internal predecessors, (4098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:44,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 735.0) internal successors, (5145), 7 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:44,734 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 735.0) internal successors, (5145), 7 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:44,734 INFO L175 Difference]: Start difference. First operand has 646 places, 645 transitions, 1407 flow. Second operand 6 states and 4098 transitions. [2023-11-29 01:36:44,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 665 transitions, 1575 flow [2023-11-29 01:36:44,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 665 transitions, 1571 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:44,743 INFO L231 Difference]: Finished difference. Result has 649 places, 649 transitions, 1457 flow [2023-11-29 01:36:44,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1395, PETRI_DIFFERENCE_MINUEND_PLACES=640, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1457, PETRI_PLACES=649, PETRI_TRANSITIONS=649} [2023-11-29 01:36:44,745 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -34 predicate places. [2023-11-29 01:36:44,745 INFO L495 AbstractCegarLoop]: Abstraction has has 649 places, 649 transitions, 1457 flow [2023-11-29 01:36:44,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 673.8333333333334) internal successors, (4043), 6 states have internal predecessors, (4043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:44,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:44,745 INFO L208 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, 1, 1] [2023-11-29 01:36:44,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 01:36:44,746 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:44,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:44,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1955357989, now seen corresponding path program 1 times [2023-11-29 01:36:44,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:44,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83823830] [2023-11-29 01:36:44,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:44,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:44,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:44,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83823830] [2023-11-29 01:36:44,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83823830] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:44,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:44,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:44,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503817423] [2023-11-29 01:36:44,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:44,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:44,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:44,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:44,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:44,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 702 out of 735 [2023-11-29 01:36:44,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 649 transitions, 1457 flow. Second operand has 3 states, 3 states have (on average 704.0) internal successors, (2112), 3 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:44,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:44,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 702 of 735 [2023-11-29 01:36:44,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:45,495 INFO L124 PetriNetUnfolderBase]: 120/3794 cut-off events. [2023-11-29 01:36:45,495 INFO L125 PetriNetUnfolderBase]: For 51/65 co-relation queries the response was YES. [2023-11-29 01:36:45,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4125 conditions, 3794 events. 120/3794 cut-off events. For 51/65 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 30368 event pairs, 8 based on Foata normal form. 0/3368 useless extension candidates. Maximal degree in co-relation 4077. Up to 64 conditions per place. [2023-11-29 01:36:45,520 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 10 selfloop transitions, 2 changer transitions 0/649 dead transitions. [2023-11-29 01:36:45,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 649 transitions, 1482 flow [2023-11-29 01:36:45,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2119 transitions. [2023-11-29 01:36:45,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9609977324263038 [2023-11-29 01:36:45,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2119 transitions. [2023-11-29 01:36:45,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2119 transitions. [2023-11-29 01:36:45,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:45,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2119 transitions. [2023-11-29 01:36:45,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 706.3333333333334) internal successors, (2119), 3 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:45,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:45,528 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:45,528 INFO L175 Difference]: Start difference. First operand has 649 places, 649 transitions, 1457 flow. Second operand 3 states and 2119 transitions. [2023-11-29 01:36:45,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 649 transitions, 1482 flow [2023-11-29 01:36:45,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 649 transitions, 1482 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:36:45,537 INFO L231 Difference]: Finished difference. Result has 650 places, 648 transitions, 1459 flow [2023-11-29 01:36:45,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1459, PETRI_PLACES=650, PETRI_TRANSITIONS=648} [2023-11-29 01:36:45,538 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -33 predicate places. [2023-11-29 01:36:45,538 INFO L495 AbstractCegarLoop]: Abstraction has has 650 places, 648 transitions, 1459 flow [2023-11-29 01:36:45,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 704.0) internal successors, (2112), 3 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:45,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:45,539 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:45,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 01:36:45,539 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:45,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:45,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1766339336, now seen corresponding path program 1 times [2023-11-29 01:36:45,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:45,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149026775] [2023-11-29 01:36:45,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:45,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:45,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:45,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149026775] [2023-11-29 01:36:45,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149026775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:45,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:45,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:45,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345856180] [2023-11-29 01:36:45,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:45,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:45,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:45,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:45,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:45,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 702 out of 735 [2023-11-29 01:36:45,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 648 transitions, 1459 flow. Second operand has 3 states, 3 states have (on average 703.6666666666666) internal successors, (2111), 3 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:45,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:45,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 702 of 735 [2023-11-29 01:36:45,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:46,406 INFO L124 PetriNetUnfolderBase]: 122/3768 cut-off events. [2023-11-29 01:36:46,406 INFO L125 PetriNetUnfolderBase]: For 39/51 co-relation queries the response was YES. [2023-11-29 01:36:46,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 3768 events. 122/3768 cut-off events. For 39/51 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 31636 event pairs, 8 based on Foata normal form. 0/3364 useless extension candidates. Maximal degree in co-relation 4101. Up to 84 conditions per place. [2023-11-29 01:36:46,433 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 10 selfloop transitions, 2 changer transitions 0/648 dead transitions. [2023-11-29 01:36:46,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 648 transitions, 1484 flow [2023-11-29 01:36:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2119 transitions. [2023-11-29 01:36:46,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9609977324263038 [2023-11-29 01:36:46,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2119 transitions. [2023-11-29 01:36:46,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2119 transitions. [2023-11-29 01:36:46,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:46,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2119 transitions. [2023-11-29 01:36:46,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 706.3333333333334) internal successors, (2119), 3 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:46,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:46,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:46,442 INFO L175 Difference]: Start difference. First operand has 650 places, 648 transitions, 1459 flow. Second operand 3 states and 2119 transitions. [2023-11-29 01:36:46,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 648 transitions, 1484 flow [2023-11-29 01:36:46,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 648 transitions, 1480 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:46,451 INFO L231 Difference]: Finished difference. Result has 649 places, 647 transitions, 1457 flow [2023-11-29 01:36:46,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1457, PETRI_PLACES=649, PETRI_TRANSITIONS=647} [2023-11-29 01:36:46,453 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -34 predicate places. [2023-11-29 01:36:46,453 INFO L495 AbstractCegarLoop]: Abstraction has has 649 places, 647 transitions, 1457 flow [2023-11-29 01:36:46,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 703.6666666666666) internal successors, (2111), 3 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:46,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:46,453 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:46,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 01:36:46,454 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:46,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1467782923, now seen corresponding path program 1 times [2023-11-29 01:36:46,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:46,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023501895] [2023-11-29 01:36:46,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:46,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:46,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:46,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023501895] [2023-11-29 01:36:46,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023501895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:46,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:46,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:46,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433248553] [2023-11-29 01:36:46,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:46,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:46,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:46,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:46,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:46,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 703 out of 735 [2023-11-29 01:36:46,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 647 transitions, 1457 flow. Second operand has 3 states, 3 states have (on average 704.3333333333334) internal successors, (2113), 3 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:46,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:46,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 703 of 735 [2023-11-29 01:36:46,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:47,711 INFO L124 PetriNetUnfolderBase]: 156/5426 cut-off events. [2023-11-29 01:36:47,711 INFO L125 PetriNetUnfolderBase]: For 45/57 co-relation queries the response was YES. [2023-11-29 01:36:47,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5803 conditions, 5426 events. 156/5426 cut-off events. For 45/57 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 50229 event pairs, 8 based on Foata normal form. 0/4848 useless extension candidates. Maximal degree in co-relation 5754. Up to 96 conditions per place. [2023-11-29 01:36:47,759 INFO L140 encePairwiseOnDemand]: 731/735 looper letters, 10 selfloop transitions, 2 changer transitions 0/648 dead transitions. [2023-11-29 01:36:47,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 648 transitions, 1484 flow [2023-11-29 01:36:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:47,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2123 transitions. [2023-11-29 01:36:47,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9628117913832199 [2023-11-29 01:36:47,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2123 transitions. [2023-11-29 01:36:47,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2123 transitions. [2023-11-29 01:36:47,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:47,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2123 transitions. [2023-11-29 01:36:47,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 707.6666666666666) internal successors, (2123), 3 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:47,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:47,765 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:47,765 INFO L175 Difference]: Start difference. First operand has 649 places, 647 transitions, 1457 flow. Second operand 3 states and 2123 transitions. [2023-11-29 01:36:47,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 648 transitions, 1484 flow [2023-11-29 01:36:47,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 648 transitions, 1480 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:47,780 INFO L231 Difference]: Finished difference. Result has 648 places, 647 transitions, 1463 flow [2023-11-29 01:36:47,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1463, PETRI_PLACES=648, PETRI_TRANSITIONS=647} [2023-11-29 01:36:47,781 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -35 predicate places. [2023-11-29 01:36:47,781 INFO L495 AbstractCegarLoop]: Abstraction has has 648 places, 647 transitions, 1463 flow [2023-11-29 01:36:47,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 704.3333333333334) internal successors, (2113), 3 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:47,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:47,782 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:47,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 01:36:47,783 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:47,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:47,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1306567313, now seen corresponding path program 1 times [2023-11-29 01:36:47,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:47,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773973927] [2023-11-29 01:36:47,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:47,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:47,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:47,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773973927] [2023-11-29 01:36:47,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773973927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:47,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:47,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:47,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992435386] [2023-11-29 01:36:47,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:47,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:47,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:47,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:47,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:47,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 702 out of 735 [2023-11-29 01:36:47,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 647 transitions, 1463 flow. Second operand has 3 states, 3 states have (on average 704.0) internal successors, (2112), 3 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:47,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:47,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 702 of 735 [2023-11-29 01:36:47,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:48,895 INFO L124 PetriNetUnfolderBase]: 142/4854 cut-off events. [2023-11-29 01:36:48,896 INFO L125 PetriNetUnfolderBase]: For 55/69 co-relation queries the response was YES. [2023-11-29 01:36:48,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5302 conditions, 4854 events. 142/4854 cut-off events. For 55/69 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 43991 event pairs, 8 based on Foata normal form. 0/4352 useless extension candidates. Maximal degree in co-relation 5253. Up to 116 conditions per place. [2023-11-29 01:36:48,991 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 10 selfloop transitions, 2 changer transitions 0/647 dead transitions. [2023-11-29 01:36:48,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 647 transitions, 1488 flow [2023-11-29 01:36:48,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2119 transitions. [2023-11-29 01:36:48,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9609977324263038 [2023-11-29 01:36:48,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2119 transitions. [2023-11-29 01:36:48,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2119 transitions. [2023-11-29 01:36:48,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:48,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2119 transitions. [2023-11-29 01:36:48,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 706.3333333333334) internal successors, (2119), 3 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:48,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:48,999 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:49,000 INFO L175 Difference]: Start difference. First operand has 648 places, 647 transitions, 1463 flow. Second operand 3 states and 2119 transitions. [2023-11-29 01:36:49,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 647 transitions, 1488 flow [2023-11-29 01:36:49,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 647 transitions, 1488 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:36:49,010 INFO L231 Difference]: Finished difference. Result has 649 places, 646 transitions, 1465 flow [2023-11-29 01:36:49,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1465, PETRI_PLACES=649, PETRI_TRANSITIONS=646} [2023-11-29 01:36:49,011 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -34 predicate places. [2023-11-29 01:36:49,011 INFO L495 AbstractCegarLoop]: Abstraction has has 649 places, 646 transitions, 1465 flow [2023-11-29 01:36:49,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 704.0) internal successors, (2112), 3 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:49,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:49,012 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:49,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 01:36:49,012 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:49,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:49,013 INFO L85 PathProgramCache]: Analyzing trace with hash 342375853, now seen corresponding path program 1 times [2023-11-29 01:36:49,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:49,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288193449] [2023-11-29 01:36:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:49,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:49,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:49,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288193449] [2023-11-29 01:36:49,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288193449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:49,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:49,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:49,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306901901] [2023-11-29 01:36:49,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:49,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:49,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:49,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:49,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:49,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 690 out of 735 [2023-11-29 01:36:49,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 646 transitions, 1465 flow. Second operand has 3 states, 3 states have (on average 692.3333333333334) internal successors, (2077), 3 states have internal predecessors, (2077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:49,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:49,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 690 of 735 [2023-11-29 01:36:49,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:50,675 INFO L124 PetriNetUnfolderBase]: 162/5508 cut-off events. [2023-11-29 01:36:50,675 INFO L125 PetriNetUnfolderBase]: For 45/57 co-relation queries the response was YES. [2023-11-29 01:36:50,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5969 conditions, 5508 events. 162/5508 cut-off events. For 45/57 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 50515 event pairs, 8 based on Foata normal form. 0/4958 useless extension candidates. Maximal degree in co-relation 5916. Up to 100 conditions per place. [2023-11-29 01:36:50,727 INFO L140 encePairwiseOnDemand]: 731/735 looper letters, 23 selfloop transitions, 2 changer transitions 0/647 dead transitions. [2023-11-29 01:36:50,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 647 transitions, 1518 flow [2023-11-29 01:36:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2097 transitions. [2023-11-29 01:36:50,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9510204081632653 [2023-11-29 01:36:50,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2097 transitions. [2023-11-29 01:36:50,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2097 transitions. [2023-11-29 01:36:50,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:50,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2097 transitions. [2023-11-29 01:36:50,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 699.0) internal successors, (2097), 3 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:50,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:50,737 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:50,737 INFO L175 Difference]: Start difference. First operand has 649 places, 646 transitions, 1465 flow. Second operand 3 states and 2097 transitions. [2023-11-29 01:36:50,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 647 transitions, 1518 flow [2023-11-29 01:36:50,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 647 transitions, 1514 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:50,750 INFO L231 Difference]: Finished difference. Result has 648 places, 646 transitions, 1471 flow [2023-11-29 01:36:50,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=642, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1471, PETRI_PLACES=648, PETRI_TRANSITIONS=646} [2023-11-29 01:36:50,751 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -35 predicate places. [2023-11-29 01:36:50,751 INFO L495 AbstractCegarLoop]: Abstraction has has 648 places, 646 transitions, 1471 flow [2023-11-29 01:36:50,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 692.3333333333334) internal successors, (2077), 3 states have internal predecessors, (2077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:50,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:50,752 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:50,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 01:36:50,753 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:50,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:50,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1410857044, now seen corresponding path program 1 times [2023-11-29 01:36:50,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:50,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534258024] [2023-11-29 01:36:50,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:50,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:50,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:50,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534258024] [2023-11-29 01:36:50,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534258024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:50,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:50,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:50,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161237372] [2023-11-29 01:36:50,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:50,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:50,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:50,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:50,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:50,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 703 out of 735 [2023-11-29 01:36:50,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 646 transitions, 1471 flow. Second operand has 3 states, 3 states have (on average 704.6666666666666) internal successors, (2114), 3 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:50,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:50,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 703 of 735 [2023-11-29 01:36:50,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:52,623 INFO L124 PetriNetUnfolderBase]: 184/6760 cut-off events. [2023-11-29 01:36:52,624 INFO L125 PetriNetUnfolderBase]: For 59/73 co-relation queries the response was YES. [2023-11-29 01:36:52,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7246 conditions, 6760 events. 184/6760 cut-off events. For 59/73 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 68596 event pairs, 4 based on Foata normal form. 0/6096 useless extension candidates. Maximal degree in co-relation 7196. Up to 100 conditions per place. [2023-11-29 01:36:52,700 INFO L140 encePairwiseOnDemand]: 731/735 looper letters, 11 selfloop transitions, 2 changer transitions 0/648 dead transitions. [2023-11-29 01:36:52,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 648 transitions, 1503 flow [2023-11-29 01:36:52,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2124 transitions. [2023-11-29 01:36:52,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.963265306122449 [2023-11-29 01:36:52,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2124 transitions. [2023-11-29 01:36:52,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2124 transitions. [2023-11-29 01:36:52,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:52,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2124 transitions. [2023-11-29 01:36:52,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 708.0) internal successors, (2124), 3 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:52,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:52,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:52,712 INFO L175 Difference]: Start difference. First operand has 648 places, 646 transitions, 1471 flow. Second operand 3 states and 2124 transitions. [2023-11-29 01:36:52,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 648 transitions, 1503 flow [2023-11-29 01:36:52,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 648 transitions, 1503 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:36:52,730 INFO L231 Difference]: Finished difference. Result has 649 places, 646 transitions, 1481 flow [2023-11-29 01:36:52,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=642, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1481, PETRI_PLACES=649, PETRI_TRANSITIONS=646} [2023-11-29 01:36:52,732 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -34 predicate places. [2023-11-29 01:36:52,732 INFO L495 AbstractCegarLoop]: Abstraction has has 649 places, 646 transitions, 1481 flow [2023-11-29 01:36:52,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 704.6666666666666) internal successors, (2114), 3 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:52,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:52,733 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:52,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 01:36:52,733 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:52,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash 195780309, now seen corresponding path program 1 times [2023-11-29 01:36:52,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:52,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861124836] [2023-11-29 01:36:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:52,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:52,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861124836] [2023-11-29 01:36:52,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861124836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:52,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:52,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:36:52,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762604215] [2023-11-29 01:36:52,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:52,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:52,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:52,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:52,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:52,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 703 out of 735 [2023-11-29 01:36:52,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 646 transitions, 1481 flow. Second operand has 3 states, 3 states have (on average 704.3333333333334) internal successors, (2113), 3 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:52,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:52,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 703 of 735 [2023-11-29 01:36:52,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:54,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1922] thread2EXIT-->L90-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][631], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, Black: 862#true, Black: 792#(<= 2147483647 ~id_0~0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 850#(= |#race~contains_key_1~0| 0), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), 173#L90-7true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 867#true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0))]) [2023-11-29 01:36:54,483 INFO L294 olderBase$Statistics]: this new event has 417 ancestors and is not cut-off event [2023-11-29 01:36:54,483 INFO L297 olderBase$Statistics]: existing Event has 425 ancestors and is not cut-off event [2023-11-29 01:36:54,483 INFO L297 olderBase$Statistics]: existing Event has 445 ancestors and is not cut-off event [2023-11-29 01:36:54,483 INFO L297 olderBase$Statistics]: existing Event has 453 ancestors and is not cut-off event [2023-11-29 01:36:54,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1922] thread2EXIT-->L90-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][631], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 792#(<= 2147483647 ~id_0~0), 786#(= |#race~get_5~0| 0), Black: 848#true, Black: 784#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, Black: 862#true, 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), 173#L90-7true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 867#true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0))]) [2023-11-29 01:36:54,487 INFO L294 olderBase$Statistics]: this new event has 429 ancestors and is not cut-off event [2023-11-29 01:36:54,488 INFO L297 olderBase$Statistics]: existing Event has 465 ancestors and is not cut-off event [2023-11-29 01:36:54,488 INFO L297 olderBase$Statistics]: existing Event has 437 ancestors and is not cut-off event [2023-11-29 01:36:54,488 INFO L297 olderBase$Statistics]: existing Event has 457 ancestors and is not cut-off event [2023-11-29 01:36:54,492 INFO L124 PetriNetUnfolderBase]: 150/6274 cut-off events. [2023-11-29 01:36:54,492 INFO L125 PetriNetUnfolderBase]: For 59/71 co-relation queries the response was YES. [2023-11-29 01:36:54,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6915 conditions, 6274 events. 150/6274 cut-off events. For 59/71 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 62434 event pairs, 12 based on Foata normal form. 0/5720 useless extension candidates. Maximal degree in co-relation 6864. Up to 157 conditions per place. [2023-11-29 01:36:54,552 INFO L140 encePairwiseOnDemand]: 731/735 looper letters, 11 selfloop transitions, 3 changer transitions 0/649 dead transitions. [2023-11-29 01:36:54,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 649 transitions, 1516 flow [2023-11-29 01:36:54,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2124 transitions. [2023-11-29 01:36:54,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.963265306122449 [2023-11-29 01:36:54,555 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2124 transitions. [2023-11-29 01:36:54,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2124 transitions. [2023-11-29 01:36:54,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:54,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2124 transitions. [2023-11-29 01:36:54,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 708.0) internal successors, (2124), 3 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:54,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:54,561 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:54,561 INFO L175 Difference]: Start difference. First operand has 649 places, 646 transitions, 1481 flow. Second operand 3 states and 2124 transitions. [2023-11-29 01:36:54,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 649 transitions, 1516 flow [2023-11-29 01:36:54,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 649 transitions, 1516 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:36:54,572 INFO L231 Difference]: Finished difference. Result has 653 places, 648 transitions, 1503 flow [2023-11-29 01:36:54,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1481, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1503, PETRI_PLACES=653, PETRI_TRANSITIONS=648} [2023-11-29 01:36:54,573 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -30 predicate places. [2023-11-29 01:36:54,573 INFO L495 AbstractCegarLoop]: Abstraction has has 653 places, 648 transitions, 1503 flow [2023-11-29 01:36:54,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 704.3333333333334) internal successors, (2113), 3 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:54,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:54,574 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:54,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 01:36:54,574 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:54,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash -871945123, now seen corresponding path program 1 times [2023-11-29 01:36:54,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:54,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99501407] [2023-11-29 01:36:54,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:54,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:54,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:54,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99501407] [2023-11-29 01:36:54,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99501407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:54,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:54,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:54,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650623332] [2023-11-29 01:36:54,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:54,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:54,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:54,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:54,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:54,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 690 out of 735 [2023-11-29 01:36:54,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 648 transitions, 1503 flow. Second operand has 3 states, 3 states have (on average 692.6666666666666) internal successors, (2078), 3 states have internal predecessors, (2078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:54,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:54,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 690 of 735 [2023-11-29 01:36:54,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:56,557 INFO L124 PetriNetUnfolderBase]: 160/6666 cut-off events. [2023-11-29 01:36:56,557 INFO L125 PetriNetUnfolderBase]: For 125/139 co-relation queries the response was YES. [2023-11-29 01:36:56,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7416 conditions, 6666 events. 160/6666 cut-off events. For 125/139 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 66563 event pairs, 6 based on Foata normal form. 0/6116 useless extension candidates. Maximal degree in co-relation 7361. Up to 106 conditions per place. [2023-11-29 01:36:56,620 INFO L140 encePairwiseOnDemand]: 731/735 looper letters, 24 selfloop transitions, 2 changer transitions 0/650 dead transitions. [2023-11-29 01:36:56,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 650 transitions, 1561 flow [2023-11-29 01:36:56,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2098 transitions. [2023-11-29 01:36:56,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9514739229024943 [2023-11-29 01:36:56,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2098 transitions. [2023-11-29 01:36:56,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2098 transitions. [2023-11-29 01:36:56,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:56,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2098 transitions. [2023-11-29 01:36:56,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 699.3333333333334) internal successors, (2098), 3 states have internal predecessors, (2098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:56,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:56,627 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:56,627 INFO L175 Difference]: Start difference. First operand has 653 places, 648 transitions, 1503 flow. Second operand 3 states and 2098 transitions. [2023-11-29 01:36:56,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 650 transitions, 1561 flow [2023-11-29 01:36:56,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 650 transitions, 1555 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:56,639 INFO L231 Difference]: Finished difference. Result has 652 places, 648 transitions, 1507 flow [2023-11-29 01:36:56,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1493, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1507, PETRI_PLACES=652, PETRI_TRANSITIONS=648} [2023-11-29 01:36:56,640 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -31 predicate places. [2023-11-29 01:36:56,640 INFO L495 AbstractCegarLoop]: Abstraction has has 652 places, 648 transitions, 1507 flow [2023-11-29 01:36:56,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 692.6666666666666) internal successors, (2078), 3 states have internal predecessors, (2078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:56,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:56,640 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:56,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 01:36:56,641 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:56,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:56,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1120270210, now seen corresponding path program 1 times [2023-11-29 01:36:56,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:56,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547819488] [2023-11-29 01:36:56,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:56,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:56,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:56,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547819488] [2023-11-29 01:36:56,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547819488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:56,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:56,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:36:56,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377012201] [2023-11-29 01:36:56,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:56,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:56,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:56,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:56,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:56,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 703 out of 735 [2023-11-29 01:36:56,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 648 transitions, 1507 flow. Second operand has 3 states, 3 states have (on average 704.6666666666666) internal successors, (2114), 3 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:56,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:56,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 703 of 735 [2023-11-29 01:36:56,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:57,927 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1921] thread1EXIT-->L89-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem56#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][632], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), 880#(not |thread2Thread1of1ForFork0_#t~short20#1|), Black: 857#true, Black: 862#true, Black: 792#(<= 2147483647 ~id_0~0), 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 670#L89-7true, 471#L60-33true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:36:57,927 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2023-11-29 01:36:57,927 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2023-11-29 01:36:57,927 INFO L297 olderBase$Statistics]: existing Event has 415 ancestors and is cut-off event [2023-11-29 01:36:57,927 INFO L297 olderBase$Statistics]: existing Event has 423 ancestors and is cut-off event [2023-11-29 01:36:57,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1921] thread1EXIT-->L89-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem56#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][632], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 792#(<= 2147483647 ~id_0~0), 786#(= |#race~get_5~0| 0), Black: 848#true, Black: 784#true, 864#(= |#race~contains_key_4~0| 0), 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 880#(not |thread2Thread1of1ForFork0_#t~short20#1|), Black: 857#true, Black: 862#true, 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 471#L60-33true, 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:36:57,987 INFO L294 olderBase$Statistics]: this new event has 399 ancestors and is cut-off event [2023-11-29 01:36:57,987 INFO L297 olderBase$Statistics]: existing Event has 407 ancestors and is cut-off event [2023-11-29 01:36:57,987 INFO L297 olderBase$Statistics]: existing Event has 427 ancestors and is cut-off event [2023-11-29 01:36:57,987 INFO L297 olderBase$Statistics]: existing Event has 435 ancestors and is cut-off event [2023-11-29 01:36:58,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1921] thread1EXIT-->L89-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem56#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][577], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 878#true, Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, Black: 862#true, Black: 792#(<= 2147483647 ~id_0~0), 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 556#L60-67true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:36:58,025 INFO L294 olderBase$Statistics]: this new event has 409 ancestors and is cut-off event [2023-11-29 01:36:58,025 INFO L297 olderBase$Statistics]: existing Event has 437 ancestors and is cut-off event [2023-11-29 01:36:58,025 INFO L297 olderBase$Statistics]: existing Event has 465 ancestors and is cut-off event [2023-11-29 01:36:58,025 INFO L297 olderBase$Statistics]: existing Event has 437 ancestors and is cut-off event [2023-11-29 01:36:58,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1921] thread1EXIT-->L89-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem56#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][577], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 878#true, Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 792#(<= 2147483647 ~id_0~0), 786#(= |#race~get_5~0| 0), Black: 848#true, Black: 784#true, 864#(= |#race~contains_key_4~0| 0), 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 857#true, Black: 862#true, 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 556#L60-67true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:36:58,044 INFO L294 olderBase$Statistics]: this new event has 421 ancestors and is cut-off event [2023-11-29 01:36:58,044 INFO L297 olderBase$Statistics]: existing Event has 449 ancestors and is cut-off event [2023-11-29 01:36:58,044 INFO L297 olderBase$Statistics]: existing Event has 449 ancestors and is cut-off event [2023-11-29 01:36:58,044 INFO L297 olderBase$Statistics]: existing Event has 477 ancestors and is cut-off event [2023-11-29 01:36:58,065 INFO L124 PetriNetUnfolderBase]: 146/6232 cut-off events. [2023-11-29 01:36:58,065 INFO L125 PetriNetUnfolderBase]: For 91/107 co-relation queries the response was YES. [2023-11-29 01:36:58,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7033 conditions, 6232 events. 146/6232 cut-off events. For 91/107 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 59690 event pairs, 10 based on Foata normal form. 0/5732 useless extension candidates. Maximal degree in co-relation 6980. Up to 173 conditions per place. [2023-11-29 01:36:58,131 INFO L140 encePairwiseOnDemand]: 731/735 looper letters, 11 selfloop transitions, 3 changer transitions 0/651 dead transitions. [2023-11-29 01:36:58,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 651 transitions, 1542 flow [2023-11-29 01:36:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:58,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2124 transitions. [2023-11-29 01:36:58,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.963265306122449 [2023-11-29 01:36:58,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2124 transitions. [2023-11-29 01:36:58,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2124 transitions. [2023-11-29 01:36:58,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:58,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2124 transitions. [2023-11-29 01:36:58,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 708.0) internal successors, (2124), 3 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:58,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:58,138 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:58,138 INFO L175 Difference]: Start difference. First operand has 652 places, 648 transitions, 1507 flow. Second operand 3 states and 2124 transitions. [2023-11-29 01:36:58,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 651 transitions, 1542 flow [2023-11-29 01:36:58,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 651 transitions, 1542 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:36:58,152 INFO L231 Difference]: Finished difference. Result has 656 places, 650 transitions, 1529 flow [2023-11-29 01:36:58,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=656, PETRI_TRANSITIONS=650} [2023-11-29 01:36:58,154 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -27 predicate places. [2023-11-29 01:36:58,154 INFO L495 AbstractCegarLoop]: Abstraction has has 656 places, 650 transitions, 1529 flow [2023-11-29 01:36:58,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 704.6666666666666) internal successors, (2114), 3 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:58,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:58,155 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:58,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 01:36:58,155 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:58,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:58,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1748262179, now seen corresponding path program 1 times [2023-11-29 01:36:58,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:58,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989301255] [2023-11-29 01:36:58,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:58,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:58,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:58,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989301255] [2023-11-29 01:36:58,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989301255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:58,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:58,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:58,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336722989] [2023-11-29 01:36:58,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:58,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:58,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:58,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:58,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:58,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 702 out of 735 [2023-11-29 01:36:58,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 650 transitions, 1529 flow. Second operand has 3 states, 3 states have (on average 703.6666666666666) internal successors, (2111), 3 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:58,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:58,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 702 of 735 [2023-11-29 01:36:58,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:59,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1922] thread2EXIT-->L90-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][632], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 878#true, Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, 884#true, Black: 862#true, Black: 792#(<= 2147483647 ~id_0~0), 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), 173#L90-7true, Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 880#(not |thread2Thread1of1ForFork0_#t~short20#1|), 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:36:59,758 INFO L294 olderBase$Statistics]: this new event has 453 ancestors and is not cut-off event [2023-11-29 01:36:59,758 INFO L297 olderBase$Statistics]: existing Event has 481 ancestors and is not cut-off event [2023-11-29 01:36:59,758 INFO L297 olderBase$Statistics]: existing Event has 461 ancestors and is not cut-off event [2023-11-29 01:36:59,758 INFO L297 olderBase$Statistics]: existing Event has 489 ancestors and is not cut-off event [2023-11-29 01:36:59,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1922] thread2EXIT-->L90-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][632], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 878#true, Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 792#(<= 2147483647 ~id_0~0), 786#(= |#race~get_5~0| 0), Black: 848#true, Black: 784#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, 884#true, Black: 862#true, 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 173#L90-7true, 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 880#(not |thread2Thread1of1ForFork0_#t~short20#1|), 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:36:59,762 INFO L294 olderBase$Statistics]: this new event has 465 ancestors and is not cut-off event [2023-11-29 01:36:59,762 INFO L297 olderBase$Statistics]: existing Event has 473 ancestors and is not cut-off event [2023-11-29 01:36:59,762 INFO L297 olderBase$Statistics]: existing Event has 493 ancestors and is not cut-off event [2023-11-29 01:36:59,762 INFO L297 olderBase$Statistics]: existing Event has 501 ancestors and is not cut-off event [2023-11-29 01:36:59,765 INFO L124 PetriNetUnfolderBase]: 112/6770 cut-off events. [2023-11-29 01:36:59,766 INFO L125 PetriNetUnfolderBase]: For 147/163 co-relation queries the response was YES. [2023-11-29 01:36:59,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7724 conditions, 6770 events. 112/6770 cut-off events. For 147/163 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 67269 event pairs, 2 based on Foata normal form. 0/6318 useless extension candidates. Maximal degree in co-relation 7669. Up to 100 conditions per place. [2023-11-29 01:36:59,845 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 12 selfloop transitions, 1 changer transitions 0/651 dead transitions. [2023-11-29 01:36:59,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 651 transitions, 1560 flow [2023-11-29 01:36:59,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:59,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2121 transitions. [2023-11-29 01:36:59,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9619047619047619 [2023-11-29 01:36:59,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2121 transitions. [2023-11-29 01:36:59,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2121 transitions. [2023-11-29 01:36:59,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:59,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2121 transitions. [2023-11-29 01:36:59,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 707.0) internal successors, (2121), 3 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:59,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:59,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:59,852 INFO L175 Difference]: Start difference. First operand has 656 places, 650 transitions, 1529 flow. Second operand 3 states and 2121 transitions. [2023-11-29 01:36:59,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 651 transitions, 1560 flow [2023-11-29 01:36:59,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 651 transitions, 1554 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:59,863 INFO L231 Difference]: Finished difference. Result has 654 places, 648 transitions, 1521 flow [2023-11-29 01:36:59,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1521, PETRI_PLACES=654, PETRI_TRANSITIONS=648} [2023-11-29 01:36:59,864 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -29 predicate places. [2023-11-29 01:36:59,865 INFO L495 AbstractCegarLoop]: Abstraction has has 654 places, 648 transitions, 1521 flow [2023-11-29 01:36:59,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 703.6666666666666) internal successors, (2111), 3 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:59,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:59,866 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:59,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 01:36:59,866 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:36:59,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:59,866 INFO L85 PathProgramCache]: Analyzing trace with hash 747795975, now seen corresponding path program 1 times [2023-11-29 01:36:59,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:59,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471038667] [2023-11-29 01:36:59,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:59,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:59,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:59,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471038667] [2023-11-29 01:36:59,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471038667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:59,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:59,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:59,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040902062] [2023-11-29 01:36:59,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:59,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:59,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:59,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:59,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:59,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 702 out of 735 [2023-11-29 01:36:59,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 648 transitions, 1521 flow. Second operand has 3 states, 3 states have (on average 703.6666666666666) internal successors, (2111), 3 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:59,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:59,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 702 of 735 [2023-11-29 01:36:59,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:37:01,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1922] thread2EXIT-->L90-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][630], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 888#true, Black: 779#true, 781#(= |#race~get_2~0| 0), 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, 884#true, Black: 862#true, Black: 792#(<= 2147483647 ~id_0~0), 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), 173#L90-7true, Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 880#(not |thread2Thread1of1ForFork0_#t~short20#1|), 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:01,248 INFO L294 olderBase$Statistics]: this new event has 453 ancestors and is not cut-off event [2023-11-29 01:37:01,248 INFO L297 olderBase$Statistics]: existing Event has 489 ancestors and is not cut-off event [2023-11-29 01:37:01,248 INFO L297 olderBase$Statistics]: existing Event has 461 ancestors and is not cut-off event [2023-11-29 01:37:01,248 INFO L297 olderBase$Statistics]: existing Event has 481 ancestors and is not cut-off event [2023-11-29 01:37:01,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1922] thread2EXIT-->L90-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][630], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, 888#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 792#(<= 2147483647 ~id_0~0), 786#(= |#race~get_5~0| 0), Black: 848#true, Black: 784#true, 864#(= |#race~contains_key_4~0| 0), 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 857#true, 884#true, Black: 862#true, 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 173#L90-7true, 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 880#(not |thread2Thread1of1ForFork0_#t~short20#1|), 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:01,253 INFO L294 olderBase$Statistics]: this new event has 465 ancestors and is not cut-off event [2023-11-29 01:37:01,253 INFO L297 olderBase$Statistics]: existing Event has 493 ancestors and is not cut-off event [2023-11-29 01:37:01,253 INFO L297 olderBase$Statistics]: existing Event has 473 ancestors and is not cut-off event [2023-11-29 01:37:01,253 INFO L297 olderBase$Statistics]: existing Event has 501 ancestors and is not cut-off event [2023-11-29 01:37:01,256 INFO L124 PetriNetUnfolderBase]: 110/6332 cut-off events. [2023-11-29 01:37:01,256 INFO L125 PetriNetUnfolderBase]: For 81/97 co-relation queries the response was YES. [2023-11-29 01:37:01,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7190 conditions, 6332 events. 110/6332 cut-off events. For 81/97 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 61385 event pairs, 2 based on Foata normal form. 0/5924 useless extension candidates. Maximal degree in co-relation 7135. Up to 100 conditions per place. [2023-11-29 01:37:01,316 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 12 selfloop transitions, 1 changer transitions 0/649 dead transitions. [2023-11-29 01:37:01,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 649 transitions, 1552 flow [2023-11-29 01:37:01,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:37:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:37:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2121 transitions. [2023-11-29 01:37:01,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9619047619047619 [2023-11-29 01:37:01,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2121 transitions. [2023-11-29 01:37:01,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2121 transitions. [2023-11-29 01:37:01,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:37:01,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2121 transitions. [2023-11-29 01:37:01,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 707.0) internal successors, (2121), 3 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:01,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:01,323 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:01,324 INFO L175 Difference]: Start difference. First operand has 654 places, 648 transitions, 1521 flow. Second operand 3 states and 2121 transitions. [2023-11-29 01:37:01,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 649 transitions, 1552 flow [2023-11-29 01:37:01,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 649 transitions, 1551 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:37:01,334 INFO L231 Difference]: Finished difference. Result has 653 places, 646 transitions, 1518 flow [2023-11-29 01:37:01,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1518, PETRI_PLACES=653, PETRI_TRANSITIONS=646} [2023-11-29 01:37:01,335 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -30 predicate places. [2023-11-29 01:37:01,335 INFO L495 AbstractCegarLoop]: Abstraction has has 653 places, 646 transitions, 1518 flow [2023-11-29 01:37:01,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 703.6666666666666) internal successors, (2111), 3 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:01,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:37:01,336 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:37:01,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 01:37:01,336 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:37:01,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:37:01,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2066606668, now seen corresponding path program 1 times [2023-11-29 01:37:01,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:37:01,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539257165] [2023-11-29 01:37:01,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:37:01,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:37:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:37:01,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:37:01,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539257165] [2023-11-29 01:37:01,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539257165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:37:01,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:37:01,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:37:01,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010110046] [2023-11-29 01:37:01,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:37:01,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:37:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:37:01,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:37:01,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:37:01,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 702 out of 735 [2023-11-29 01:37:01,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 646 transitions, 1518 flow. Second operand has 3 states, 3 states have (on average 704.0) internal successors, (2112), 3 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:01,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:37:01,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 702 of 735 [2023-11-29 01:37:01,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:37:03,311 INFO L124 PetriNetUnfolderBase]: 120/6834 cut-off events. [2023-11-29 01:37:03,312 INFO L125 PetriNetUnfolderBase]: For 109/129 co-relation queries the response was YES. [2023-11-29 01:37:03,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7772 conditions, 6834 events. 120/6834 cut-off events. For 109/129 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 65786 event pairs, 6 based on Foata normal form. 0/6410 useless extension candidates. Maximal degree in co-relation 7717. Up to 108 conditions per place. [2023-11-29 01:37:03,399 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 11 selfloop transitions, 1 changer transitions 0/646 dead transitions. [2023-11-29 01:37:03,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 646 transitions, 1544 flow [2023-11-29 01:37:03,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:37:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:37:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2120 transitions. [2023-11-29 01:37:03,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9614512471655329 [2023-11-29 01:37:03,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2120 transitions. [2023-11-29 01:37:03,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2120 transitions. [2023-11-29 01:37:03,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:37:03,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2120 transitions. [2023-11-29 01:37:03,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 706.6666666666666) internal successors, (2120), 3 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:03,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:03,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:03,406 INFO L175 Difference]: Start difference. First operand has 653 places, 646 transitions, 1518 flow. Second operand 3 states and 2120 transitions. [2023-11-29 01:37:03,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 646 transitions, 1544 flow [2023-11-29 01:37:03,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 646 transitions, 1543 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:37:03,418 INFO L231 Difference]: Finished difference. Result has 652 places, 644 transitions, 1515 flow [2023-11-29 01:37:03,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1515, PETRI_PLACES=652, PETRI_TRANSITIONS=644} [2023-11-29 01:37:03,419 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -31 predicate places. [2023-11-29 01:37:03,419 INFO L495 AbstractCegarLoop]: Abstraction has has 652 places, 644 transitions, 1515 flow [2023-11-29 01:37:03,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 704.0) internal successors, (2112), 3 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:03,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:37:03,420 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:37:03,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 01:37:03,420 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:37:03,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:37:03,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1734176784, now seen corresponding path program 1 times [2023-11-29 01:37:03,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:37:03,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047216152] [2023-11-29 01:37:03,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:37:03,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:37:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:37:03,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:37:03,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047216152] [2023-11-29 01:37:03,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047216152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:37:03,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:37:03,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:37:03,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375476626] [2023-11-29 01:37:03,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:37:03,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:37:03,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:37:03,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:37:03,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:37:03,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 702 out of 735 [2023-11-29 01:37:03,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 644 transitions, 1515 flow. Second operand has 3 states, 3 states have (on average 704.0) internal successors, (2112), 3 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:03,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:37:03,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 702 of 735 [2023-11-29 01:37:03,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:37:04,954 INFO L124 PetriNetUnfolderBase]: 120/6694 cut-off events. [2023-11-29 01:37:04,954 INFO L125 PetriNetUnfolderBase]: For 109/129 co-relation queries the response was YES. [2023-11-29 01:37:05,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7630 conditions, 6694 events. 120/6694 cut-off events. For 109/129 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 64255 event pairs, 6 based on Foata normal form. 0/6310 useless extension candidates. Maximal degree in co-relation 7575. Up to 108 conditions per place. [2023-11-29 01:37:05,020 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 11 selfloop transitions, 1 changer transitions 0/644 dead transitions. [2023-11-29 01:37:05,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 644 transitions, 1541 flow [2023-11-29 01:37:05,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:37:05,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:37:05,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2120 transitions. [2023-11-29 01:37:05,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9614512471655329 [2023-11-29 01:37:05,022 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2120 transitions. [2023-11-29 01:37:05,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2120 transitions. [2023-11-29 01:37:05,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:37:05,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2120 transitions. [2023-11-29 01:37:05,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 706.6666666666666) internal successors, (2120), 3 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:05,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:05,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:05,026 INFO L175 Difference]: Start difference. First operand has 652 places, 644 transitions, 1515 flow. Second operand 3 states and 2120 transitions. [2023-11-29 01:37:05,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 644 transitions, 1541 flow [2023-11-29 01:37:05,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 644 transitions, 1540 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:37:05,035 INFO L231 Difference]: Finished difference. Result has 651 places, 642 transitions, 1512 flow [2023-11-29 01:37:05,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1512, PETRI_PLACES=651, PETRI_TRANSITIONS=642} [2023-11-29 01:37:05,037 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -32 predicate places. [2023-11-29 01:37:05,037 INFO L495 AbstractCegarLoop]: Abstraction has has 651 places, 642 transitions, 1512 flow [2023-11-29 01:37:05,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 704.0) internal successors, (2112), 3 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:05,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:37:05,038 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:37:05,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 01:37:05,038 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:37:05,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:37:05,038 INFO L85 PathProgramCache]: Analyzing trace with hash 903393530, now seen corresponding path program 1 times [2023-11-29 01:37:05,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:37:05,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803709689] [2023-11-29 01:37:05,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:37:05,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:37:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:37:05,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:37:05,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803709689] [2023-11-29 01:37:05,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803709689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:37:05,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:37:05,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:37:05,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898964495] [2023-11-29 01:37:05,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:37:05,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:37:05,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:37:05,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:37:05,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:37:05,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 702 out of 735 [2023-11-29 01:37:05,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 642 transitions, 1512 flow. Second operand has 3 states, 3 states have (on average 703.6666666666666) internal successors, (2111), 3 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:05,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:37:05,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 702 of 735 [2023-11-29 01:37:05,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:37:06,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1922] thread2EXIT-->L90-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][624], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 896#true, Black: 779#true, 781#(= |#race~get_2~0| 0), 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, Black: 862#true, Black: 792#(<= 2147483647 ~id_0~0), 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), 173#L90-7true, Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 900#true, Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 880#(not |thread2Thread1of1ForFork0_#t~short20#1|), 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:06,598 INFO L294 olderBase$Statistics]: this new event has 481 ancestors and is not cut-off event [2023-11-29 01:37:06,598 INFO L297 olderBase$Statistics]: existing Event has 489 ancestors and is not cut-off event [2023-11-29 01:37:06,599 INFO L297 olderBase$Statistics]: existing Event has 497 ancestors and is not cut-off event [2023-11-29 01:37:06,599 INFO L297 olderBase$Statistics]: existing Event has 489 ancestors and is not cut-off event [2023-11-29 01:37:06,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1922] thread2EXIT-->L90-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][624], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 896#true, Black: 779#true, 781#(= |#race~get_2~0| 0), 792#(<= 2147483647 ~id_0~0), 786#(= |#race~get_5~0| 0), Black: 848#true, Black: 784#true, 864#(= |#race~contains_key_4~0| 0), 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 857#true, Black: 862#true, 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 173#L90-7true, 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 900#true, Black: 807#true, 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 880#(not |thread2Thread1of1ForFork0_#t~short20#1|), 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:06,602 INFO L294 olderBase$Statistics]: this new event has 493 ancestors and is not cut-off event [2023-11-29 01:37:06,602 INFO L297 olderBase$Statistics]: existing Event has 501 ancestors and is not cut-off event [2023-11-29 01:37:06,602 INFO L297 olderBase$Statistics]: existing Event has 509 ancestors and is not cut-off event [2023-11-29 01:37:06,602 INFO L297 olderBase$Statistics]: existing Event has 501 ancestors and is not cut-off event [2023-11-29 01:37:06,606 INFO L124 PetriNetUnfolderBase]: 116/6508 cut-off events. [2023-11-29 01:37:06,606 INFO L125 PetriNetUnfolderBase]: For 87/155 co-relation queries the response was YES. [2023-11-29 01:37:06,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7590 conditions, 6508 events. 116/6508 cut-off events. For 87/155 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 63280 event pairs, 12 based on Foata normal form. 2/6192 useless extension candidates. Maximal degree in co-relation 7535. Up to 196 conditions per place. [2023-11-29 01:37:06,652 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 10 selfloop transitions, 2 changer transitions 0/642 dead transitions. [2023-11-29 01:37:06,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 642 transitions, 1537 flow [2023-11-29 01:37:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:37:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:37:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2119 transitions. [2023-11-29 01:37:06,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9609977324263038 [2023-11-29 01:37:06,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2119 transitions. [2023-11-29 01:37:06,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2119 transitions. [2023-11-29 01:37:06,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:37:06,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2119 transitions. [2023-11-29 01:37:06,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 706.3333333333334) internal successors, (2119), 3 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:06,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:06,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:06,658 INFO L175 Difference]: Start difference. First operand has 651 places, 642 transitions, 1512 flow. Second operand 3 states and 2119 transitions. [2023-11-29 01:37:06,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 642 transitions, 1537 flow [2023-11-29 01:37:06,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 642 transitions, 1536 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:37:06,667 INFO L231 Difference]: Finished difference. Result has 651 places, 641 transitions, 1513 flow [2023-11-29 01:37:06,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1509, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1513, PETRI_PLACES=651, PETRI_TRANSITIONS=641} [2023-11-29 01:37:06,668 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -32 predicate places. [2023-11-29 01:37:06,669 INFO L495 AbstractCegarLoop]: Abstraction has has 651 places, 641 transitions, 1513 flow [2023-11-29 01:37:06,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 703.6666666666666) internal successors, (2111), 3 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:06,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:37:06,669 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:37:06,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 01:37:06,669 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:37:06,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:37:06,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1542313482, now seen corresponding path program 1 times [2023-11-29 01:37:06,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:37:06,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444873410] [2023-11-29 01:37:06,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:37:06,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:37:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:37:06,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:37:06,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444873410] [2023-11-29 01:37:06,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444873410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:37:06,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:37:06,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:37:06,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658506425] [2023-11-29 01:37:06,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:37:06,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:37:06,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:37:06,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:37:06,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:37:06,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 702 out of 735 [2023-11-29 01:37:06,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 641 transitions, 1513 flow. Second operand has 3 states, 3 states have (on average 704.0) internal successors, (2112), 3 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:06,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:37:06,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 702 of 735 [2023-11-29 01:37:06,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:37:08,154 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1921] thread1EXIT-->L89-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem56#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][567], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, Black: 862#true, 904#true, Black: 792#(<= 2147483647 ~id_0~0), 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, 900#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 878#true, 474#L60-62true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:08,154 INFO L294 olderBase$Statistics]: this new event has 476 ancestors and is cut-off event [2023-11-29 01:37:08,155 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is cut-off event [2023-11-29 01:37:08,155 INFO L297 olderBase$Statistics]: existing Event has 460 ancestors and is cut-off event [2023-11-29 01:37:08,155 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is cut-off event [2023-11-29 01:37:08,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1921] thread1EXIT-->L89-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem56#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][567], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 792#(<= 2147483647 ~id_0~0), 786#(= |#race~get_5~0| 0), Black: 848#true, Black: 784#true, 864#(= |#race~contains_key_4~0| 0), 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 857#true, Black: 862#true, 904#true, 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, 900#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 878#true, 474#L60-62true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:08,187 INFO L294 olderBase$Statistics]: this new event has 488 ancestors and is cut-off event [2023-11-29 01:37:08,188 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is cut-off event [2023-11-29 01:37:08,188 INFO L297 olderBase$Statistics]: existing Event has 480 ancestors and is cut-off event [2023-11-29 01:37:08,188 INFO L297 olderBase$Statistics]: existing Event has 480 ancestors and is cut-off event [2023-11-29 01:37:08,243 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1856] L60-61-->L60-62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet26#1][534], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, Black: 862#true, 904#true, Black: 792#(<= 2147483647 ~id_0~0), 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, 900#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 878#true, 474#L60-62true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:08,243 INFO L294 olderBase$Statistics]: this new event has 460 ancestors and is not cut-off event [2023-11-29 01:37:08,243 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2023-11-29 01:37:08,243 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2023-11-29 01:37:08,243 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2023-11-29 01:37:08,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1921] thread1EXIT-->L89-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem56#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][622], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 906#(= |thread2Thread1of1ForFork0_#t~nondet26#1| |#race~result_9~0|), Black: 779#true, 781#(= |#race~get_2~0| 0), 208#L60-63true, 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, Black: 862#true, Black: 792#(<= 2147483647 ~id_0~0), 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, 900#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 878#true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:08,244 INFO L294 olderBase$Statistics]: this new event has 461 ancestors and is cut-off event [2023-11-29 01:37:08,244 INFO L297 olderBase$Statistics]: existing Event has 469 ancestors and is cut-off event [2023-11-29 01:37:08,244 INFO L297 olderBase$Statistics]: existing Event has 477 ancestors and is cut-off event [2023-11-29 01:37:08,244 INFO L297 olderBase$Statistics]: existing Event has 469 ancestors and is cut-off event [2023-11-29 01:37:08,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1921] thread1EXIT-->L89-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem56#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][622], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 906#(= |thread2Thread1of1ForFork0_#t~nondet26#1| |#race~result_9~0|), Black: 779#true, 781#(= |#race~get_2~0| 0), 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, Black: 862#true, Black: 792#(<= 2147483647 ~id_0~0), 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 320#L60-64true, 726#(= |#race~id_3~0| 0), Black: 873#true, 900#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 878#true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:08,246 INFO L294 olderBase$Statistics]: this new event has 462 ancestors and is cut-off event [2023-11-29 01:37:08,246 INFO L297 olderBase$Statistics]: existing Event has 470 ancestors and is cut-off event [2023-11-29 01:37:08,246 INFO L297 olderBase$Statistics]: existing Event has 478 ancestors and is cut-off event [2023-11-29 01:37:08,246 INFO L297 olderBase$Statistics]: existing Event has 470 ancestors and is cut-off event [2023-11-29 01:37:08,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1921] thread1EXIT-->L89-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem56#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][567], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, Black: 862#true, 904#true, Black: 792#(<= 2147483647 ~id_0~0), 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, 900#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 880#(not |thread2Thread1of1ForFork0_#t~short20#1|), 475#L62true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:08,256 INFO L294 olderBase$Statistics]: this new event has 471 ancestors and is cut-off event [2023-11-29 01:37:08,256 INFO L297 olderBase$Statistics]: existing Event has 479 ancestors and is cut-off event [2023-11-29 01:37:08,256 INFO L297 olderBase$Statistics]: existing Event has 487 ancestors and is cut-off event [2023-11-29 01:37:08,256 INFO L297 olderBase$Statistics]: existing Event has 479 ancestors and is cut-off event [2023-11-29 01:37:08,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1856] L60-61-->L60-62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet26#1][534], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 792#(<= 2147483647 ~id_0~0), 786#(= |#race~get_5~0| 0), Black: 848#true, Black: 784#true, 864#(= |#race~contains_key_4~0| 0), 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 857#true, 904#true, Black: 862#true, 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 900#true, Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 878#true, 474#L60-62true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:08,259 INFO L294 olderBase$Statistics]: this new event has 472 ancestors and is not cut-off event [2023-11-29 01:37:08,259 INFO L297 olderBase$Statistics]: existing Event has 480 ancestors and is not cut-off event [2023-11-29 01:37:08,259 INFO L297 olderBase$Statistics]: existing Event has 480 ancestors and is not cut-off event [2023-11-29 01:37:08,259 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2023-11-29 01:37:08,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1921] thread1EXIT-->L89-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem56#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][622], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 906#(= |thread2Thread1of1ForFork0_#t~nondet26#1| |#race~result_9~0|), Black: 779#true, 781#(= |#race~get_2~0| 0), 208#L60-63true, 792#(<= 2147483647 ~id_0~0), 786#(= |#race~get_5~0| 0), Black: 848#true, Black: 784#true, 864#(= |#race~contains_key_4~0| 0), 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 857#true, Black: 862#true, 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 900#true, Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 878#true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:08,260 INFO L294 olderBase$Statistics]: this new event has 473 ancestors and is cut-off event [2023-11-29 01:37:08,260 INFO L297 olderBase$Statistics]: existing Event has 489 ancestors and is cut-off event [2023-11-29 01:37:08,260 INFO L297 olderBase$Statistics]: existing Event has 481 ancestors and is cut-off event [2023-11-29 01:37:08,260 INFO L297 olderBase$Statistics]: existing Event has 481 ancestors and is cut-off event [2023-11-29 01:37:08,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1921] thread1EXIT-->L89-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem56#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][622], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 906#(= |thread2Thread1of1ForFork0_#t~nondet26#1| |#race~result_9~0|), Black: 779#true, 781#(= |#race~get_2~0| 0), 792#(<= 2147483647 ~id_0~0), 786#(= |#race~get_5~0| 0), Black: 848#true, Black: 784#true, 864#(= |#race~contains_key_4~0| 0), 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 857#true, Black: 862#true, 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 320#L60-64true, 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 900#true, Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 878#true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:08,262 INFO L294 olderBase$Statistics]: this new event has 474 ancestors and is cut-off event [2023-11-29 01:37:08,262 INFO L297 olderBase$Statistics]: existing Event has 482 ancestors and is cut-off event [2023-11-29 01:37:08,262 INFO L297 olderBase$Statistics]: existing Event has 490 ancestors and is cut-off event [2023-11-29 01:37:08,262 INFO L297 olderBase$Statistics]: existing Event has 482 ancestors and is cut-off event [2023-11-29 01:37:08,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1921] thread1EXIT-->L89-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem56#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][567], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 792#(<= 2147483647 ~id_0~0), 786#(= |#race~get_5~0| 0), Black: 848#true, Black: 784#true, 864#(= |#race~contains_key_4~0| 0), 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 857#true, 904#true, Black: 862#true, 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 900#true, Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 880#(not |thread2Thread1of1ForFork0_#t~short20#1|), 475#L62true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:08,266 INFO L294 olderBase$Statistics]: this new event has 483 ancestors and is cut-off event [2023-11-29 01:37:08,266 INFO L297 olderBase$Statistics]: existing Event has 491 ancestors and is cut-off event [2023-11-29 01:37:08,266 INFO L297 olderBase$Statistics]: existing Event has 491 ancestors and is cut-off event [2023-11-29 01:37:08,266 INFO L297 olderBase$Statistics]: existing Event has 499 ancestors and is cut-off event [2023-11-29 01:37:08,274 INFO L124 PetriNetUnfolderBase]: 158/6508 cut-off events. [2023-11-29 01:37:08,274 INFO L125 PetriNetUnfolderBase]: For 149/167 co-relation queries the response was YES. [2023-11-29 01:37:08,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7700 conditions, 6508 events. 158/6508 cut-off events. For 149/167 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 62832 event pairs, 16 based on Foata normal form. 0/6176 useless extension candidates. Maximal degree in co-relation 7645. Up to 224 conditions per place. [2023-11-29 01:37:08,348 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 10 selfloop transitions, 2 changer transitions 0/641 dead transitions. [2023-11-29 01:37:08,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 641 transitions, 1538 flow [2023-11-29 01:37:08,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:37:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:37:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2119 transitions. [2023-11-29 01:37:08,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9609977324263038 [2023-11-29 01:37:08,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2119 transitions. [2023-11-29 01:37:08,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2119 transitions. [2023-11-29 01:37:08,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:37:08,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2119 transitions. [2023-11-29 01:37:08,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 706.3333333333334) internal successors, (2119), 3 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:08,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:08,355 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:08,356 INFO L175 Difference]: Start difference. First operand has 651 places, 641 transitions, 1513 flow. Second operand 3 states and 2119 transitions. [2023-11-29 01:37:08,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 641 transitions, 1538 flow [2023-11-29 01:37:08,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 641 transitions, 1534 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:37:08,367 INFO L231 Difference]: Finished difference. Result has 650 places, 640 transitions, 1511 flow [2023-11-29 01:37:08,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1511, PETRI_PLACES=650, PETRI_TRANSITIONS=640} [2023-11-29 01:37:08,368 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -33 predicate places. [2023-11-29 01:37:08,368 INFO L495 AbstractCegarLoop]: Abstraction has has 650 places, 640 transitions, 1511 flow [2023-11-29 01:37:08,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 704.0) internal successors, (2112), 3 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:08,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:37:08,369 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:37:08,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 01:37:08,369 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:37:08,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:37:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1603098161, now seen corresponding path program 1 times [2023-11-29 01:37:08,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:37:08,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904240345] [2023-11-29 01:37:08,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:37:08,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:37:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:37:09,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:37:09,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904240345] [2023-11-29 01:37:09,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904240345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:37:09,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:37:09,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:37:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983502096] [2023-11-29 01:37:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:37:09,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:37:09,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:37:09,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:37:09,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:37:09,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 690 out of 735 [2023-11-29 01:37:09,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 640 transitions, 1511 flow. Second operand has 6 states, 6 states have (on average 691.6666666666666) internal successors, (4150), 6 states have internal predecessors, (4150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:09,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:37:09,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 690 of 735 [2023-11-29 01:37:09,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:37:10,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1922] thread2EXIT-->L90-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][621], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, 913#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 862#true, 904#true, Black: 792#(<= 2147483647 ~id_0~0), 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 173#L90-7true, 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 880#(not |thread2Thread1of1ForFork0_#t~short20#1|), 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:10,979 INFO L294 olderBase$Statistics]: this new event has 481 ancestors and is not cut-off event [2023-11-29 01:37:10,979 INFO L297 olderBase$Statistics]: existing Event has 497 ancestors and is not cut-off event [2023-11-29 01:37:10,979 INFO L297 olderBase$Statistics]: existing Event has 489 ancestors and is not cut-off event [2023-11-29 01:37:10,979 INFO L297 olderBase$Statistics]: existing Event has 489 ancestors and is not cut-off event [2023-11-29 01:37:10,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1922] thread2EXIT-->L90-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][621], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 792#(<= 2147483647 ~id_0~0), 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 864#(= |#race~contains_key_4~0| 0), 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 857#true, 913#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 904#true, Black: 862#true, Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 850#(= |#race~contains_key_1~0| 0), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), 173#L90-7true, Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 880#(not |thread2Thread1of1ForFork0_#t~short20#1|), 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:10,984 INFO L294 olderBase$Statistics]: this new event has 493 ancestors and is not cut-off event [2023-11-29 01:37:10,984 INFO L297 olderBase$Statistics]: existing Event has 501 ancestors and is not cut-off event [2023-11-29 01:37:10,984 INFO L297 olderBase$Statistics]: existing Event has 509 ancestors and is not cut-off event [2023-11-29 01:37:10,984 INFO L297 olderBase$Statistics]: existing Event has 501 ancestors and is not cut-off event [2023-11-29 01:37:10,987 INFO L124 PetriNetUnfolderBase]: 86/6252 cut-off events. [2023-11-29 01:37:10,987 INFO L125 PetriNetUnfolderBase]: For 73/139 co-relation queries the response was YES. [2023-11-29 01:37:11,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7385 conditions, 6252 events. 86/6252 cut-off events. For 73/139 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 59802 event pairs, 0 based on Foata normal form. 8/6036 useless extension candidates. Maximal degree in co-relation 7328. Up to 106 conditions per place. [2023-11-29 01:37:11,059 INFO L140 encePairwiseOnDemand]: 730/735 looper letters, 17 selfloop transitions, 4 changer transitions 0/639 dead transitions. [2023-11-29 01:37:11,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 639 transitions, 1551 flow [2023-11-29 01:37:11,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:37:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:37:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4162 transitions. [2023-11-29 01:37:11,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.943764172335601 [2023-11-29 01:37:11,063 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4162 transitions. [2023-11-29 01:37:11,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4162 transitions. [2023-11-29 01:37:11,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:37:11,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4162 transitions. [2023-11-29 01:37:11,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 693.6666666666666) internal successors, (4162), 6 states have internal predecessors, (4162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:11,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 735.0) internal successors, (5145), 7 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:11,069 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 735.0) internal successors, (5145), 7 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:11,069 INFO L175 Difference]: Start difference. First operand has 650 places, 640 transitions, 1511 flow. Second operand 6 states and 4162 transitions. [2023-11-29 01:37:11,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 639 transitions, 1551 flow [2023-11-29 01:37:11,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 639 transitions, 1547 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:37:11,085 INFO L231 Difference]: Finished difference. Result has 652 places, 639 transitions, 1513 flow [2023-11-29 01:37:11,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1513, PETRI_PLACES=652, PETRI_TRANSITIONS=639} [2023-11-29 01:37:11,085 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -31 predicate places. [2023-11-29 01:37:11,085 INFO L495 AbstractCegarLoop]: Abstraction has has 652 places, 639 transitions, 1513 flow [2023-11-29 01:37:11,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 691.6666666666666) internal successors, (4150), 6 states have internal predecessors, (4150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:11,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:37:11,086 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:37:11,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-29 01:37:11,087 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:37:11,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:37:11,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1528188064, now seen corresponding path program 1 times [2023-11-29 01:37:11,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:37:11,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48368875] [2023-11-29 01:37:11,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:37:11,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:37:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:37:11,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:37:11,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48368875] [2023-11-29 01:37:11,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48368875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:37:11,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:37:11,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:37:11,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909711959] [2023-11-29 01:37:11,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:37:11,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:37:11,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:37:11,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:37:11,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:37:11,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 702 out of 735 [2023-11-29 01:37:11,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 639 transitions, 1513 flow. Second operand has 3 states, 3 states have (on average 704.6666666666666) internal successors, (2114), 3 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:11,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:37:11,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 702 of 735 [2023-11-29 01:37:11,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:37:12,608 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1922] thread2EXIT-->L90-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][621], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, 913#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 862#true, Black: 792#(<= 2147483647 ~id_0~0), 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), 173#L90-7true, Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 880#(not |thread2Thread1of1ForFork0_#t~short20#1|), 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 915#true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:12,608 INFO L294 olderBase$Statistics]: this new event has 481 ancestors and is not cut-off event [2023-11-29 01:37:12,608 INFO L297 olderBase$Statistics]: existing Event has 489 ancestors and is not cut-off event [2023-11-29 01:37:12,608 INFO L297 olderBase$Statistics]: existing Event has 489 ancestors and is not cut-off event [2023-11-29 01:37:12,608 INFO L297 olderBase$Statistics]: existing Event has 497 ancestors and is not cut-off event [2023-11-29 01:37:12,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1922] thread2EXIT-->L90-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][621], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 792#(<= 2147483647 ~id_0~0), 786#(= |#race~get_5~0| 0), Black: 848#true, Black: 784#true, 864#(= |#race~contains_key_4~0| 0), 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 857#true, 913#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 862#true, 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), 173#L90-7true, Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 880#(not |thread2Thread1of1ForFork0_#t~short20#1|), 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 915#true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:12,614 INFO L294 olderBase$Statistics]: this new event has 493 ancestors and is not cut-off event [2023-11-29 01:37:12,614 INFO L297 olderBase$Statistics]: existing Event has 501 ancestors and is not cut-off event [2023-11-29 01:37:12,614 INFO L297 olderBase$Statistics]: existing Event has 509 ancestors and is not cut-off event [2023-11-29 01:37:12,614 INFO L297 olderBase$Statistics]: existing Event has 501 ancestors and is not cut-off event [2023-11-29 01:37:12,620 INFO L124 PetriNetUnfolderBase]: 98/6308 cut-off events. [2023-11-29 01:37:12,620 INFO L125 PetriNetUnfolderBase]: For 87/119 co-relation queries the response was YES. [2023-11-29 01:37:12,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7390 conditions, 6308 events. 98/6308 cut-off events. For 87/119 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 60671 event pairs, 6 based on Foata normal form. 0/6094 useless extension candidates. Maximal degree in co-relation 7335. Up to 124 conditions per place. [2023-11-29 01:37:12,724 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 9 selfloop transitions, 1 changer transitions 0/637 dead transitions. [2023-11-29 01:37:12,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 637 transitions, 1529 flow [2023-11-29 01:37:12,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:37:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:37:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2118 transitions. [2023-11-29 01:37:12,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9605442176870749 [2023-11-29 01:37:12,728 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2118 transitions. [2023-11-29 01:37:12,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2118 transitions. [2023-11-29 01:37:12,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:37:12,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2118 transitions. [2023-11-29 01:37:12,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 706.0) internal successors, (2118), 3 states have internal predecessors, (2118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:12,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:12,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:12,734 INFO L175 Difference]: Start difference. First operand has 652 places, 639 transitions, 1513 flow. Second operand 3 states and 2118 transitions. [2023-11-29 01:37:12,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 637 transitions, 1529 flow [2023-11-29 01:37:12,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 637 transitions, 1522 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 01:37:12,750 INFO L231 Difference]: Finished difference. Result has 648 places, 637 transitions, 1504 flow [2023-11-29 01:37:12,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1504, PETRI_PLACES=648, PETRI_TRANSITIONS=637} [2023-11-29 01:37:12,751 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -35 predicate places. [2023-11-29 01:37:12,751 INFO L495 AbstractCegarLoop]: Abstraction has has 648 places, 637 transitions, 1504 flow [2023-11-29 01:37:12,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 704.6666666666666) internal successors, (2114), 3 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:12,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:37:12,752 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:37:12,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-29 01:37:12,752 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2023-11-29 01:37:12,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:37:12,753 INFO L85 PathProgramCache]: Analyzing trace with hash -953329737, now seen corresponding path program 1 times [2023-11-29 01:37:12,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:37:12,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733416084] [2023-11-29 01:37:12,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:37:12,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:37:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:37:12,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:37:12,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733416084] [2023-11-29 01:37:12,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733416084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:37:12,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:37:12,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:37:12,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322509202] [2023-11-29 01:37:12,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:37:12,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:37:12,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:37:12,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:37:12,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:37:12,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 702 out of 735 [2023-11-29 01:37:12,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 637 transitions, 1504 flow. Second operand has 3 states, 3 states have (on average 704.6666666666666) internal successors, (2114), 3 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:12,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:37:12,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 702 of 735 [2023-11-29 01:37:12,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:37:14,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1921] thread1EXIT-->L89-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem56#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][567], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 208#L60-63true, 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, Black: 862#true, Black: 792#(<= 2147483647 ~id_0~0), 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 878#true, 919#true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 915#true, 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:14,203 INFO L294 olderBase$Statistics]: this new event has 469 ancestors and is cut-off event [2023-11-29 01:37:14,203 INFO L297 olderBase$Statistics]: existing Event has 477 ancestors and is cut-off event [2023-11-29 01:37:14,203 INFO L297 olderBase$Statistics]: existing Event has 461 ancestors and is cut-off event [2023-11-29 01:37:14,203 INFO L297 olderBase$Statistics]: existing Event has 469 ancestors and is cut-off event [2023-11-29 01:37:14,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1921] thread1EXIT-->L89-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem56#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][567], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 208#L60-63true, 792#(<= 2147483647 ~id_0~0), 786#(= |#race~get_5~0| 0), Black: 848#true, Black: 784#true, 864#(= |#race~contains_key_4~0| 0), 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 857#true, Black: 862#true, 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 878#true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 919#true, 915#true, 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:14,230 INFO L294 olderBase$Statistics]: this new event has 481 ancestors and is cut-off event [2023-11-29 01:37:14,230 INFO L297 olderBase$Statistics]: existing Event has 489 ancestors and is cut-off event [2023-11-29 01:37:14,230 INFO L297 olderBase$Statistics]: existing Event has 473 ancestors and is cut-off event [2023-11-29 01:37:14,230 INFO L297 olderBase$Statistics]: existing Event has 481 ancestors and is cut-off event [2023-11-29 01:37:14,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1860] L60-62-->L60-63: Formula: (= |v_#race~result_9~0_1| |v_thread2Thread1of1ForFork0_#t~nondet26#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_3|, #race~result_9~0=|v_#race~result_9~0_1|} AuxVars[] AssignedVars[#race~result_9~0][539], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 208#L60-63true, 786#(= |#race~get_5~0| 0), Black: 784#true, Black: 848#true, 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 864#(= |#race~contains_key_4~0| 0), Black: 857#true, Black: 862#true, Black: 792#(<= 2147483647 ~id_0~0), 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 878#true, 919#true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 915#true, 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:14,268 INFO L294 olderBase$Statistics]: this new event has 461 ancestors and is not cut-off event [2023-11-29 01:37:14,268 INFO L297 olderBase$Statistics]: existing Event has 477 ancestors and is not cut-off event [2023-11-29 01:37:14,268 INFO L297 olderBase$Statistics]: existing Event has 469 ancestors and is not cut-off event [2023-11-29 01:37:14,268 INFO L297 olderBase$Statistics]: existing Event has 469 ancestors and is not cut-off event [2023-11-29 01:37:14,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1860] L60-62-->L60-63: Formula: (= |v_#race~result_9~0_1| |v_thread2Thread1of1ForFork0_#t~nondet26#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_3|, #race~result_9~0=|v_#race~result_9~0_1|} AuxVars[] AssignedVars[#race~result_9~0][539], [Black: 832#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 831#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 829#true, Black: 833#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 779#true, 781#(= |#race~get_2~0| 0), 208#L60-63true, 792#(<= 2147483647 ~id_0~0), 786#(= |#race~get_5~0| 0), Black: 848#true, Black: 784#true, 864#(= |#race~contains_key_4~0| 0), 834#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 857#true, Black: 862#true, 850#(= |#race~contains_key_1~0| 0), Black: 801#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 799#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 797#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 869#(not |thread1Thread1of1ForFork1_#t~short7#1|), 718#(= |#race~id_0~0| 0), 726#(= |#race~id_3~0| 0), Black: 873#true, Black: 811#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 807#true, Black: 809#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 859#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 810#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 878#true, 919#true, 823#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 915#true, 670#L89-7true, 812#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 875#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset)))]) [2023-11-29 01:37:14,279 INFO L294 olderBase$Statistics]: this new event has 473 ancestors and is not cut-off event [2023-11-29 01:37:14,279 INFO L297 olderBase$Statistics]: existing Event has 489 ancestors and is not cut-off event [2023-11-29 01:37:14,279 INFO L297 olderBase$Statistics]: existing Event has 481 ancestors and is not cut-off event [2023-11-29 01:37:14,279 INFO L297 olderBase$Statistics]: existing Event has 481 ancestors and is not cut-off event [2023-11-29 01:37:14,289 INFO L124 PetriNetUnfolderBase]: 104/6332 cut-off events. [2023-11-29 01:37:14,289 INFO L125 PetriNetUnfolderBase]: For 95/113 co-relation queries the response was YES. [2023-11-29 01:37:14,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7286 conditions, 6332 events. 104/6332 cut-off events. For 95/113 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 60259 event pairs, 8 based on Foata normal form. 8/6122 useless extension candidates. Maximal degree in co-relation 7231. Up to 138 conditions per place. [2023-11-29 01:37:14,352 INFO L140 encePairwiseOnDemand]: 732/735 looper letters, 0 selfloop transitions, 0 changer transitions 635/635 dead transitions. [2023-11-29 01:37:14,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 635 transitions, 1518 flow [2023-11-29 01:37:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:37:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:37:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2117 transitions. [2023-11-29 01:37:14,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9600907029478458 [2023-11-29 01:37:14,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2117 transitions. [2023-11-29 01:37:14,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2117 transitions. [2023-11-29 01:37:14,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:37:14,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2117 transitions. [2023-11-29 01:37:14,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 705.6666666666666) internal successors, (2117), 3 states have internal predecessors, (2117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:14,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:14,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 735.0) internal successors, (2940), 4 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:14,359 INFO L175 Difference]: Start difference. First operand has 648 places, 637 transitions, 1504 flow. Second operand 3 states and 2117 transitions. [2023-11-29 01:37:14,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 635 transitions, 1518 flow [2023-11-29 01:37:14,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 635 transitions, 1517 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:37:14,367 INFO L231 Difference]: Finished difference. Result has 647 places, 0 transitions, 0 flow [2023-11-29 01:37:14,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=735, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=647, PETRI_TRANSITIONS=0} [2023-11-29 01:37:14,368 INFO L281 CegarLoopForPetriNet]: 683 programPoint places, -36 predicate places. [2023-11-29 01:37:14,368 INFO L495 AbstractCegarLoop]: Abstraction has has 647 places, 0 transitions, 0 flow [2023-11-29 01:37:14,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 704.6666666666666) internal successors, (2114), 3 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:14,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (131 of 132 remaining) [2023-11-29 01:37:14,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (130 of 132 remaining) [2023-11-29 01:37:14,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (129 of 132 remaining) [2023-11-29 01:37:14,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (128 of 132 remaining) [2023-11-29 01:37:14,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (127 of 132 remaining) [2023-11-29 01:37:14,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (126 of 132 remaining) [2023-11-29 01:37:14,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (125 of 132 remaining) [2023-11-29 01:37:14,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (124 of 132 remaining) [2023-11-29 01:37:14,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (123 of 132 remaining) [2023-11-29 01:37:14,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (122 of 132 remaining) [2023-11-29 01:37:14,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (121 of 132 remaining) [2023-11-29 01:37:14,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (120 of 132 remaining) [2023-11-29 01:37:14,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (119 of 132 remaining) [2023-11-29 01:37:14,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (118 of 132 remaining) [2023-11-29 01:37:14,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (117 of 132 remaining) [2023-11-29 01:37:14,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (116 of 132 remaining) [2023-11-29 01:37:14,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (115 of 132 remaining) [2023-11-29 01:37:14,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (114 of 132 remaining) [2023-11-29 01:37:14,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (113 of 132 remaining) [2023-11-29 01:37:14,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (112 of 132 remaining) [2023-11-29 01:37:14,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (111 of 132 remaining) [2023-11-29 01:37:14,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (110 of 132 remaining) [2023-11-29 01:37:14,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (109 of 132 remaining) [2023-11-29 01:37:14,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (108 of 132 remaining) [2023-11-29 01:37:14,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (107 of 132 remaining) [2023-11-29 01:37:14,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (106 of 132 remaining) [2023-11-29 01:37:14,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (105 of 132 remaining) [2023-11-29 01:37:14,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (104 of 132 remaining) [2023-11-29 01:37:14,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (103 of 132 remaining) [2023-11-29 01:37:14,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (102 of 132 remaining) [2023-11-29 01:37:14,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (101 of 132 remaining) [2023-11-29 01:37:14,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (100 of 132 remaining) [2023-11-29 01:37:14,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (99 of 132 remaining) [2023-11-29 01:37:14,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (98 of 132 remaining) [2023-11-29 01:37:14,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (97 of 132 remaining) [2023-11-29 01:37:14,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (96 of 132 remaining) [2023-11-29 01:37:14,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (95 of 132 remaining) [2023-11-29 01:37:14,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (94 of 132 remaining) [2023-11-29 01:37:14,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (93 of 132 remaining) [2023-11-29 01:37:14,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (92 of 132 remaining) [2023-11-29 01:37:14,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (91 of 132 remaining) [2023-11-29 01:37:14,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (90 of 132 remaining) [2023-11-29 01:37:14,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (89 of 132 remaining) [2023-11-29 01:37:14,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (88 of 132 remaining) [2023-11-29 01:37:14,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (87 of 132 remaining) [2023-11-29 01:37:14,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (86 of 132 remaining) [2023-11-29 01:37:14,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (85 of 132 remaining) [2023-11-29 01:37:14,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (84 of 132 remaining) [2023-11-29 01:37:14,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (83 of 132 remaining) [2023-11-29 01:37:14,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (82 of 132 remaining) [2023-11-29 01:37:14,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (81 of 132 remaining) [2023-11-29 01:37:14,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (80 of 132 remaining) [2023-11-29 01:37:14,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (79 of 132 remaining) [2023-11-29 01:37:14,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (78 of 132 remaining) [2023-11-29 01:37:14,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (77 of 132 remaining) [2023-11-29 01:37:14,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (76 of 132 remaining) [2023-11-29 01:37:14,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (75 of 132 remaining) [2023-11-29 01:37:14,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (74 of 132 remaining) [2023-11-29 01:37:14,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (73 of 132 remaining) [2023-11-29 01:37:14,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (72 of 132 remaining) [2023-11-29 01:37:14,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (71 of 132 remaining) [2023-11-29 01:37:14,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (70 of 132 remaining) [2023-11-29 01:37:14,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (69 of 132 remaining) [2023-11-29 01:37:14,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (68 of 132 remaining) [2023-11-29 01:37:14,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (67 of 132 remaining) [2023-11-29 01:37:14,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (66 of 132 remaining) [2023-11-29 01:37:14,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (65 of 132 remaining) [2023-11-29 01:37:14,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (64 of 132 remaining) [2023-11-29 01:37:14,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (63 of 132 remaining) [2023-11-29 01:37:14,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (62 of 132 remaining) [2023-11-29 01:37:14,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (61 of 132 remaining) [2023-11-29 01:37:14,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (60 of 132 remaining) [2023-11-29 01:37:14,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (59 of 132 remaining) [2023-11-29 01:37:14,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (58 of 132 remaining) [2023-11-29 01:37:14,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (57 of 132 remaining) [2023-11-29 01:37:14,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (56 of 132 remaining) [2023-11-29 01:37:14,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (55 of 132 remaining) [2023-11-29 01:37:14,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (54 of 132 remaining) [2023-11-29 01:37:14,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (53 of 132 remaining) [2023-11-29 01:37:14,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (52 of 132 remaining) [2023-11-29 01:37:14,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 132 remaining) [2023-11-29 01:37:14,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 132 remaining) [2023-11-29 01:37:14,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 132 remaining) [2023-11-29 01:37:14,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 132 remaining) [2023-11-29 01:37:14,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 132 remaining) [2023-11-29 01:37:14,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 132 remaining) [2023-11-29 01:37:14,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 132 remaining) [2023-11-29 01:37:14,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (44 of 132 remaining) [2023-11-29 01:37:14,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (43 of 132 remaining) [2023-11-29 01:37:14,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (42 of 132 remaining) [2023-11-29 01:37:14,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (41 of 132 remaining) [2023-11-29 01:37:14,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (40 of 132 remaining) [2023-11-29 01:37:14,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (39 of 132 remaining) [2023-11-29 01:37:14,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (38 of 132 remaining) [2023-11-29 01:37:14,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (37 of 132 remaining) [2023-11-29 01:37:14,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (36 of 132 remaining) [2023-11-29 01:37:14,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 132 remaining) [2023-11-29 01:37:14,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (34 of 132 remaining) [2023-11-29 01:37:14,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (33 of 132 remaining) [2023-11-29 01:37:14,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (32 of 132 remaining) [2023-11-29 01:37:14,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (31 of 132 remaining) [2023-11-29 01:37:14,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (30 of 132 remaining) [2023-11-29 01:37:14,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (29 of 132 remaining) [2023-11-29 01:37:14,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (28 of 132 remaining) [2023-11-29 01:37:14,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (27 of 132 remaining) [2023-11-29 01:37:14,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (26 of 132 remaining) [2023-11-29 01:37:14,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (25 of 132 remaining) [2023-11-29 01:37:14,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 132 remaining) [2023-11-29 01:37:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 132 remaining) [2023-11-29 01:37:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 132 remaining) [2023-11-29 01:37:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 132 remaining) [2023-11-29 01:37:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 132 remaining) [2023-11-29 01:37:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (19 of 132 remaining) [2023-11-29 01:37:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 132 remaining) [2023-11-29 01:37:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (17 of 132 remaining) [2023-11-29 01:37:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (16 of 132 remaining) [2023-11-29 01:37:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (15 of 132 remaining) [2023-11-29 01:37:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (14 of 132 remaining) [2023-11-29 01:37:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (13 of 132 remaining) [2023-11-29 01:37:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (12 of 132 remaining) [2023-11-29 01:37:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (11 of 132 remaining) [2023-11-29 01:37:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (10 of 132 remaining) [2023-11-29 01:37:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (9 of 132 remaining) [2023-11-29 01:37:14,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (8 of 132 remaining) [2023-11-29 01:37:14,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (7 of 132 remaining) [2023-11-29 01:37:14,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (6 of 132 remaining) [2023-11-29 01:37:14,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (5 of 132 remaining) [2023-11-29 01:37:14,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (4 of 132 remaining) [2023-11-29 01:37:14,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (3 of 132 remaining) [2023-11-29 01:37:14,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (2 of 132 remaining) [2023-11-29 01:37:14,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (1 of 132 remaining) [2023-11-29 01:37:14,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (0 of 132 remaining) [2023-11-29 01:37:14,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-11-29 01:37:14,380 INFO L445 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] [2023-11-29 01:37:14,387 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 01:37:14,387 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:37:14,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:37:14 BasicIcfg [2023-11-29 01:37:14,394 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:37:14,394 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:37:14,394 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:37:14,394 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:37:14,395 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:36:18" (3/4) ... [2023-11-29 01:37:14,396 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 01:37:14,400 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-29 01:37:14,400 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-29 01:37:14,413 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2023-11-29 01:37:14,414 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-29 01:37:14,415 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 01:37:14,415 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 01:37:14,542 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 01:37:14,542 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 01:37:14,542 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:37:14,543 INFO L158 Benchmark]: Toolchain (without parser) took 57433.76ms. Allocated memory was 178.3MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 147.9MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2023-11-29 01:37:14,544 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 125.8MB. Free memory is still 99.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:37:14,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.42ms. Allocated memory is still 178.3MB. Free memory was 147.4MB in the beginning and 133.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 01:37:14,544 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.25ms. Allocated memory is still 178.3MB. Free memory was 133.4MB in the beginning and 129.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:37:14,545 INFO L158 Benchmark]: Boogie Preprocessor took 61.56ms. Allocated memory is still 178.3MB. Free memory was 129.2MB in the beginning and 125.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:37:14,560 INFO L158 Benchmark]: RCFGBuilder took 1091.31ms. Allocated memory is still 178.3MB. Free memory was 125.0MB in the beginning and 139.3MB in the end (delta: -14.2MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2023-11-29 01:37:14,560 INFO L158 Benchmark]: TraceAbstraction took 55736.17ms. Allocated memory was 178.3MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 138.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2023-11-29 01:37:14,561 INFO L158 Benchmark]: Witness Printer took 148.45ms. Allocated memory is still 5.2GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 01:37:14,562 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.21ms. Allocated memory is still 125.8MB. Free memory is still 99.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.42ms. Allocated memory is still 178.3MB. Free memory was 147.4MB in the beginning and 133.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.25ms. Allocated memory is still 178.3MB. Free memory was 133.4MB in the beginning and 129.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.56ms. Allocated memory is still 178.3MB. Free memory was 129.2MB in the beginning and 125.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1091.31ms. Allocated memory is still 178.3MB. Free memory was 125.0MB in the beginning and 139.3MB in the end (delta: -14.2MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. * TraceAbstraction took 55736.17ms. Allocated memory was 178.3MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 138.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. * Witness Printer took 148.45ms. Allocated memory is still 5.2GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: 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: 60]: 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: 60]: 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: 60]: 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: 60]: 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: 60]: 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: 60]: 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: 60]: 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: 60]: 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: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: 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: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: 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: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: 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: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: 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: 84]: 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: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: 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 5 procedures, 1003 locations, 132 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: 55.5s, OverallIterations: 41, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 47.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3654 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1634 mSDsluCounter, 1246 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 614 mSDsCounter, 951 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5327 IncrementalHoareTripleChecker+Invalid, 6278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 951 mSolverCounterUnsat, 632 mSDtfsCounter, 5327 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1529occurred in iteration=32, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 9389 NumberOfCodeBlocks, 9389 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 9348 ConstructedInterpolants, 0 QuantifiedInterpolants, 10009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 PerfectInterpolantSequences, 0/0 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 80 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 01:37:14,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd03cad-1d11-4f1a-b1b4-98968092cab1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE