./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed871f78-5579-4781-a167-bb3dd216668c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed871f78-5579-4781-a167-bb3dd216668c/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_ed871f78-5579-4781-a167-bb3dd216668c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed871f78-5579-4781-a167-bb3dd216668c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed871f78-5579-4781-a167-bb3dd216668c/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_ed871f78-5579-4781-a167-bb3dd216668c/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 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:32:57,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:32:57,416 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed871f78-5579-4781-a167-bb3dd216668c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 01:32:57,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:32:57,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:32:57,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:32:57,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:32:57,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:32:57,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:32:57,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:32:57,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:32:57,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:32:57,450 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:32:57,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:32:57,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:32:57,452 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:32:57,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:32:57,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:32:57,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:32:57,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:32:57,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:32:57,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:32:57,456 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 01:32:57,456 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:32:57,457 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:32:57,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:32:57,458 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:32:57,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:32:57,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:32:57,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:32:57,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:32:57,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:32:57,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:32:57,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:32:57,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:32:57,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:32:57,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:32:57,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:32:57,462 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:32:57,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:32:57,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:32:57,463 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_ed871f78-5579-4781-a167-bb3dd216668c/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_ed871f78-5579-4781-a167-bb3dd216668c/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 -> 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 [2023-11-29 01:32:57,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:32:57,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:32:57,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:32:57,736 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:32:57,736 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:32:57,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed871f78-5579-4781-a167-bb3dd216668c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2023-11-29 01:33:00,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:33:00,696 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:33:00,696 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed871f78-5579-4781-a167-bb3dd216668c/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2023-11-29 01:33:00,705 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed871f78-5579-4781-a167-bb3dd216668c/bin/uautomizer-verify-BQ2R08f2Ya/data/0118ddc1d/a8173e285c0946fe98baa348130ca73c/FLAGf8b301352 [2023-11-29 01:33:00,720 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed871f78-5579-4781-a167-bb3dd216668c/bin/uautomizer-verify-BQ2R08f2Ya/data/0118ddc1d/a8173e285c0946fe98baa348130ca73c [2023-11-29 01:33:00,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:33:00,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:33:00,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:33:00,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:33:00,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:33:00,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:33:00" (1/1) ... [2023-11-29 01:33:00,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@366afd08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:00, skipping insertion in model container [2023-11-29 01:33:00,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:33:00" (1/1) ... [2023-11-29 01:33:00,759 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:33:00,962 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:33:00,971 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:33:01,011 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:33:01,028 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:33:01,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:01 WrapperNode [2023-11-29 01:33:01,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:33:01,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:33:01,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:33:01,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:33:01,038 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:33:01" (1/1) ... [2023-11-29 01:33:01,054 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:33:01" (1/1) ... [2023-11-29 01:33:01,093 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 517 [2023-11-29 01:33:01,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:33:01,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:33:01,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:33:01,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:33:01,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:01" (1/1) ... [2023-11-29 01:33:01,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:01" (1/1) ... [2023-11-29 01:33:01,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:01" (1/1) ... [2023-11-29 01:33:01,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:01" (1/1) ... [2023-11-29 01:33:01,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:01" (1/1) ... [2023-11-29 01:33:01,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:01" (1/1) ... [2023-11-29 01:33:01,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:01" (1/1) ... [2023-11-29 01:33:01,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:01" (1/1) ... [2023-11-29 01:33:01,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:33:01,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:33:01,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:33:01,159 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:33:01,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:01" (1/1) ... [2023-11-29 01:33:01,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:33:01,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed871f78-5579-4781-a167-bb3dd216668c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:33:01,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed871f78-5579-4781-a167-bb3dd216668c/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:33:01,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed871f78-5579-4781-a167-bb3dd216668c/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:33:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:33:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:33:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 01:33:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 01:33:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 01:33:01,226 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 01:33:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 01:33:01,226 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 01:33:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 01:33:01,227 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 01:33:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 01:33:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:33:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:33:01,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:33:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:33:01,229 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:33:01,339 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:33:01,341 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:33:02,146 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:33:02,181 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:33:02,182 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-29 01:33:02,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:33:02 BoogieIcfgContainer [2023-11-29 01:33:02,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:33:02,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:33:02,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:33:02,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:33:02,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:33:00" (1/3) ... [2023-11-29 01:33:02,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471882ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:33:02, skipping insertion in model container [2023-11-29 01:33:02,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:33:01" (2/3) ... [2023-11-29 01:33:02,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471882ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:33:02, skipping insertion in model container [2023-11-29 01:33:02,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:33:02" (3/3) ... [2023-11-29 01:33:02,217 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2023-11-29 01:33:02,225 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 01:33:02,233 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:33:02,234 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-11-29 01:33:02,234 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 01:33:02,398 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 01:33:02,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 629 places, 652 transitions, 1325 flow [2023-11-29 01:33:02,737 INFO L124 PetriNetUnfolderBase]: 33/649 cut-off events. [2023-11-29 01:33:02,737 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 01:33:02,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 649 events. 33/649 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1548 event pairs, 0 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 467. Up to 3 conditions per place. [2023-11-29 01:33:02,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 629 places, 652 transitions, 1325 flow [2023-11-29 01:33:02,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 601 places, 622 transitions, 1262 flow [2023-11-29 01:33:02,785 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:33:02,792 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;@1a75d7d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:33:02,792 INFO L358 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2023-11-29 01:33:02,797 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 01:33:02,798 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2023-11-29 01:33:02,798 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:33:02,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:33:02,799 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] [2023-11-29 01:33:02,799 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:33:02,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:02,805 INFO L85 PathProgramCache]: Analyzing trace with hash 582377638, now seen corresponding path program 1 times [2023-11-29 01:33:02,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:02,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842934685] [2023-11-29 01:33:02,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:02,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:03,014 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:33:03,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:33:03,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842934685] [2023-11-29 01:33:03,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842934685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:33:03,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:33:03,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:33:03,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130259812] [2023-11-29 01:33:03,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:33:03,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:33:03,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:03,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:33:03,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:33:03,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 652 [2023-11-29 01:33:03,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 622 transitions, 1262 flow. Second operand has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 0 states have call successors, (0), 0 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:33:03,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:33:03,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 652 [2023-11-29 01:33:03,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:33:03,541 INFO L124 PetriNetUnfolderBase]: 37/1091 cut-off events. [2023-11-29 01:33:03,541 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-29 01:33:03,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 1091 events. 37/1091 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5003 event pairs, 12 based on Foata normal form. 35/960 useless extension candidates. Maximal degree in co-relation 839. Up to 39 conditions per place. [2023-11-29 01:33:03,582 INFO L140 encePairwiseOnDemand]: 631/652 looper letters, 14 selfloop transitions, 2 changer transitions 6/603 dead transitions. [2023-11-29 01:33:03,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 603 transitions, 1256 flow [2023-11-29 01:33:03,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:33:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:33:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1877 transitions. [2023-11-29 01:33:03,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9596114519427403 [2023-11-29 01:33:03,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1877 transitions. [2023-11-29 01:33:03,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1877 transitions. [2023-11-29 01:33:03,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:33:03,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1877 transitions. [2023-11-29 01:33:03,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 625.6666666666666) internal successors, (1877), 3 states have internal predecessors, (1877), 0 states have call successors, (0), 0 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:33:03,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:33:03,641 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:33:03,643 INFO L175 Difference]: Start difference. First operand has 601 places, 622 transitions, 1262 flow. Second operand 3 states and 1877 transitions. [2023-11-29 01:33:03,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 603 transitions, 1256 flow [2023-11-29 01:33:03,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 603 transitions, 1244 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 01:33:03,668 INFO L231 Difference]: Finished difference. Result has 596 places, 597 transitions, 1204 flow [2023-11-29 01:33:03,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1204, PETRI_PLACES=596, PETRI_TRANSITIONS=597} [2023-11-29 01:33:03,675 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -5 predicate places. [2023-11-29 01:33:03,676 INFO L495 AbstractCegarLoop]: Abstraction has has 596 places, 597 transitions, 1204 flow [2023-11-29 01:33:03,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 0 states have call successors, (0), 0 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:33:03,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:33:03,678 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] [2023-11-29 01:33:03,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:33:03,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:33:03,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:03,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1241024781, now seen corresponding path program 1 times [2023-11-29 01:33:03,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:03,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014967313] [2023-11-29 01:33:03,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:03,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:03,745 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:33:03,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:33:03,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014967313] [2023-11-29 01:33:03,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014967313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:33:03,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:33:03,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:33:03,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553394427] [2023-11-29 01:33:03,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:33:03,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:33:03,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:03,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:33:03,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:33:03,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 652 [2023-11-29 01:33:03,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 597 transitions, 1204 flow. Second operand has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 0 states have call successors, (0), 0 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:33:03,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:33:03,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 652 [2023-11-29 01:33:03,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:33:04,220 INFO L124 PetriNetUnfolderBase]: 57/1484 cut-off events. [2023-11-29 01:33:04,221 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 01:33:04,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 1484 events. 57/1484 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8334 event pairs, 20 based on Foata normal form. 0/1254 useless extension candidates. Maximal degree in co-relation 1520. Up to 51 conditions per place. [2023-11-29 01:33:04,266 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 14 selfloop transitions, 2 changer transitions 0/596 dead transitions. [2023-11-29 01:33:04,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 596 transitions, 1234 flow [2023-11-29 01:33:04,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:33:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:33:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2023-11-29 01:33:04,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9504089979550102 [2023-11-29 01:33:04,273 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1859 transitions. [2023-11-29 01:33:04,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1859 transitions. [2023-11-29 01:33:04,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:33:04,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1859 transitions. [2023-11-29 01:33:04,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 0 states have call successors, (0), 0 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:33:04,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:33:04,290 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:33:04,290 INFO L175 Difference]: Start difference. First operand has 596 places, 597 transitions, 1204 flow. Second operand 3 states and 1859 transitions. [2023-11-29 01:33:04,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 596 transitions, 1234 flow [2023-11-29 01:33:04,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 596 transitions, 1230 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:33:04,304 INFO L231 Difference]: Finished difference. Result has 589 places, 596 transitions, 1202 flow [2023-11-29 01:33:04,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1202, PETRI_PLACES=589, PETRI_TRANSITIONS=596} [2023-11-29 01:33:04,306 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -12 predicate places. [2023-11-29 01:33:04,307 INFO L495 AbstractCegarLoop]: Abstraction has has 589 places, 596 transitions, 1202 flow [2023-11-29 01:33:04,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 0 states have call successors, (0), 0 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:33:04,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:33:04,309 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] [2023-11-29 01:33:04,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:33:04,309 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:33:04,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:04,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1559938138, now seen corresponding path program 1 times [2023-11-29 01:33:04,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:04,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529344844] [2023-11-29 01:33:04,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:04,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:04,370 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:33:04,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:33:04,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529344844] [2023-11-29 01:33:04,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529344844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:33:04,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:33:04,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:33:04,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29511831] [2023-11-29 01:33:04,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:33:04,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:33:04,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:04,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:33:04,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:33:04,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 652 [2023-11-29 01:33:04,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 596 transitions, 1202 flow. Second operand has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 0 states have call successors, (0), 0 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:33:04,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:33:04,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 652 [2023-11-29 01:33:04,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:33:04,819 INFO L124 PetriNetUnfolderBase]: 57/1471 cut-off events. [2023-11-29 01:33:04,819 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 01:33:04,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 1471 events. 57/1471 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7820 event pairs, 20 based on Foata normal form. 0/1247 useless extension candidates. Maximal degree in co-relation 1491. Up to 51 conditions per place. [2023-11-29 01:33:04,858 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 14 selfloop transitions, 2 changer transitions 0/595 dead transitions. [2023-11-29 01:33:04,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 595 transitions, 1232 flow [2023-11-29 01:33:04,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:33:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:33:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2023-11-29 01:33:04,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9504089979550102 [2023-11-29 01:33:04,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1859 transitions. [2023-11-29 01:33:04,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1859 transitions. [2023-11-29 01:33:04,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:33:04,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1859 transitions. [2023-11-29 01:33:04,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 0 states have call successors, (0), 0 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:33:04,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:33:04,880 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:33:04,880 INFO L175 Difference]: Start difference. First operand has 589 places, 596 transitions, 1202 flow. Second operand 3 states and 1859 transitions. [2023-11-29 01:33:04,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 595 transitions, 1232 flow [2023-11-29 01:33:04,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 595 transitions, 1228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:33:04,893 INFO L231 Difference]: Finished difference. Result has 588 places, 595 transitions, 1200 flow [2023-11-29 01:33:04,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=586, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1200, PETRI_PLACES=588, PETRI_TRANSITIONS=595} [2023-11-29 01:33:04,895 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -13 predicate places. [2023-11-29 01:33:04,896 INFO L495 AbstractCegarLoop]: Abstraction has has 588 places, 595 transitions, 1200 flow [2023-11-29 01:33:04,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 0 states have call successors, (0), 0 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:33:04,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:33:04,898 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] [2023-11-29 01:33:04,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:33:04,898 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:33:04,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:04,899 INFO L85 PathProgramCache]: Analyzing trace with hash 558769353, now seen corresponding path program 1 times [2023-11-29 01:33:04,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:04,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463029355] [2023-11-29 01:33:04,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:04,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:04,953 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:33:04,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:33:04,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463029355] [2023-11-29 01:33:04,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463029355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:33:04,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:33:04,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:33:04,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878731764] [2023-11-29 01:33:04,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:33:04,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:33:04,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:04,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:33:04,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:33:04,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 652 [2023-11-29 01:33:04,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 595 transitions, 1200 flow. Second operand has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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:33:04,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:33:04,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 652 [2023-11-29 01:33:04,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:33:05,495 INFO L124 PetriNetUnfolderBase]: 72/1606 cut-off events. [2023-11-29 01:33:05,495 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-29 01:33:05,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1703 conditions, 1606 events. 72/1606 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9244 event pairs, 32 based on Foata normal form. 0/1374 useless extension candidates. Maximal degree in co-relation 1653. Up to 80 conditions per place. [2023-11-29 01:33:05,550 INFO L140 encePairwiseOnDemand]: 646/652 looper letters, 16 selfloop transitions, 1 changer transitions 0/590 dead transitions. [2023-11-29 01:33:05,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 590 transitions, 1224 flow [2023-11-29 01:33:05,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:33:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:33:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2023-11-29 01:33:05,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9468302658486708 [2023-11-29 01:33:05,557 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1852 transitions. [2023-11-29 01:33:05,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1852 transitions. [2023-11-29 01:33:05,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:33:05,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1852 transitions. [2023-11-29 01:33:05,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 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:33:05,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:33:05,573 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:33:05,573 INFO L175 Difference]: Start difference. First operand has 588 places, 595 transitions, 1200 flow. Second operand 3 states and 1852 transitions. [2023-11-29 01:33:05,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 590 transitions, 1224 flow [2023-11-29 01:33:05,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 590 transitions, 1220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:33:05,587 INFO L231 Difference]: Finished difference. Result has 583 places, 590 transitions, 1188 flow [2023-11-29 01:33:05,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1188, PETRI_PLACES=583, PETRI_TRANSITIONS=590} [2023-11-29 01:33:05,590 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -18 predicate places. [2023-11-29 01:33:05,590 INFO L495 AbstractCegarLoop]: Abstraction has has 583 places, 590 transitions, 1188 flow [2023-11-29 01:33:05,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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:33:05,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:33:05,592 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:33:05,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:33:05,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:33:05,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:05,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1946572602, now seen corresponding path program 1 times [2023-11-29 01:33:05,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:05,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876026467] [2023-11-29 01:33:05,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:05,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:06,293 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:33:06,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:33:06,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876026467] [2023-11-29 01:33:06,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876026467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:33:06,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:33:06,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:33:06,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994099569] [2023-11-29 01:33:06,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:33:06,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:33:06,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:06,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:33:06,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:33:07,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 652 [2023-11-29 01:33:07,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 590 transitions, 1188 flow. Second operand has 6 states, 6 states have (on average 525.5) internal successors, (3153), 6 states have internal predecessors, (3153), 0 states have call successors, (0), 0 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:33:07,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:33:07,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 652 [2023-11-29 01:33:07,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:33:57,198 INFO L124 PetriNetUnfolderBase]: 75197/283532 cut-off events. [2023-11-29 01:33:57,198 INFO L125 PetriNetUnfolderBase]: For 909/1027 co-relation queries the response was YES. [2023-11-29 01:33:58,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383232 conditions, 283532 events. 75197/283532 cut-off events. For 909/1027 co-relation queries the response was YES. Maximal size of possible extension queue 4706. Compared 4697737 event pairs, 67808 based on Foata normal form. 0/250460 useless extension candidates. Maximal degree in co-relation 383183. Up to 99375 conditions per place. [2023-11-29 01:33:59,679 INFO L140 encePairwiseOnDemand]: 634/652 looper letters, 90 selfloop transitions, 15 changer transitions 0/587 dead transitions. [2023-11-29 01:33:59,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 587 transitions, 1392 flow [2023-11-29 01:33:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:33:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:33:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3252 transitions. [2023-11-29 01:33:59,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8312883435582822 [2023-11-29 01:33:59,691 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3252 transitions. [2023-11-29 01:33:59,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3252 transitions. [2023-11-29 01:33:59,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:33:59,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3252 transitions. [2023-11-29 01:33:59,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 542.0) internal successors, (3252), 6 states have internal predecessors, (3252), 0 states have call successors, (0), 0 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:33:59,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:33:59,719 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:33:59,719 INFO L175 Difference]: Start difference. First operand has 583 places, 590 transitions, 1188 flow. Second operand 6 states and 3252 transitions. [2023-11-29 01:33:59,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 587 transitions, 1392 flow [2023-11-29 01:33:59,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 587 transitions, 1391 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:33:59,732 INFO L231 Difference]: Finished difference. Result has 584 places, 587 transitions, 1211 flow [2023-11-29 01:33:59,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1211, PETRI_PLACES=584, PETRI_TRANSITIONS=587} [2023-11-29 01:33:59,734 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -17 predicate places. [2023-11-29 01:33:59,734 INFO L495 AbstractCegarLoop]: Abstraction has has 584 places, 587 transitions, 1211 flow [2023-11-29 01:33:59,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 525.5) internal successors, (3153), 6 states have internal predecessors, (3153), 0 states have call successors, (0), 0 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:33:59,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:33:59,737 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:33:59,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:33:59,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:33:59,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:59,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1048261058, now seen corresponding path program 1 times [2023-11-29 01:33:59,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:59,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760889471] [2023-11-29 01:33:59,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:59,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:59,789 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:33:59,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:33:59,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760889471] [2023-11-29 01:33:59,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760889471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:33:59,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:33:59,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:33:59,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498714315] [2023-11-29 01:33:59,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:33:59,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:33:59,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:59,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:33:59,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:33:59,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 652 [2023-11-29 01:33:59,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 587 transitions, 1211 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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:33:59,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:33:59,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 652 [2023-11-29 01:33:59,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:00,167 INFO L124 PetriNetUnfolderBase]: 37/1110 cut-off events. [2023-11-29 01:34:00,168 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 01:34:00,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 1110 events. 37/1110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5083 event pairs, 12 based on Foata normal form. 0/962 useless extension candidates. Maximal degree in co-relation 1127. Up to 38 conditions per place. [2023-11-29 01:34:00,184 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 13 selfloop transitions, 2 changer transitions 0/586 dead transitions. [2023-11-29 01:34:00,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 586 transitions, 1239 flow [2023-11-29 01:34:00,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2023-11-29 01:34:00,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9514314928425358 [2023-11-29 01:34:00,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1861 transitions. [2023-11-29 01:34:00,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1861 transitions. [2023-11-29 01:34:00,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:00,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1861 transitions. [2023-11-29 01:34:00,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 620.3333333333334) internal successors, (1861), 3 states have internal predecessors, (1861), 0 states have call successors, (0), 0 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:34:00,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:00,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:00,197 INFO L175 Difference]: Start difference. First operand has 584 places, 587 transitions, 1211 flow. Second operand 3 states and 1861 transitions. [2023-11-29 01:34:00,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 586 transitions, 1239 flow [2023-11-29 01:34:00,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 586 transitions, 1209 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:34:00,209 INFO L231 Difference]: Finished difference. Result has 580 places, 586 transitions, 1183 flow [2023-11-29 01:34:00,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=580, PETRI_TRANSITIONS=586} [2023-11-29 01:34:00,211 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2023-11-29 01:34:00,211 INFO L495 AbstractCegarLoop]: Abstraction has has 580 places, 586 transitions, 1183 flow [2023-11-29 01:34:00,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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:34:00,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:00,213 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] [2023-11-29 01:34:00,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:34:00,213 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:00,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1213090306, now seen corresponding path program 1 times [2023-11-29 01:34:00,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:00,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131083497] [2023-11-29 01:34:00,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:00,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:00,260 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:34:00,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:00,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131083497] [2023-11-29 01:34:00,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131083497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:00,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:00,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:00,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795371836] [2023-11-29 01:34:00,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:00,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:00,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:00,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:00,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:00,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 652 [2023-11-29 01:34:00,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 586 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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:34:00,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:00,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 652 [2023-11-29 01:34:00,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:00,850 INFO L124 PetriNetUnfolderBase]: 137/2498 cut-off events. [2023-11-29 01:34:00,851 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-29 01:34:00,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2677 conditions, 2498 events. 137/2498 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 18597 event pairs, 64 based on Foata normal form. 0/2141 useless extension candidates. Maximal degree in co-relation 2627. Up to 141 conditions per place. [2023-11-29 01:34:00,890 INFO L140 encePairwiseOnDemand]: 646/652 looper letters, 16 selfloop transitions, 1 changer transitions 0/581 dead transitions. [2023-11-29 01:34:00,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 581 transitions, 1207 flow [2023-11-29 01:34:00,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2023-11-29 01:34:00,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9468302658486708 [2023-11-29 01:34:00,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1852 transitions. [2023-11-29 01:34:00,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1852 transitions. [2023-11-29 01:34:00,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:00,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1852 transitions. [2023-11-29 01:34:00,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 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:34:00,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:00,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:00,907 INFO L175 Difference]: Start difference. First operand has 580 places, 586 transitions, 1183 flow. Second operand 3 states and 1852 transitions. [2023-11-29 01:34:00,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 581 transitions, 1207 flow [2023-11-29 01:34:00,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 581 transitions, 1203 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:34:00,919 INFO L231 Difference]: Finished difference. Result has 575 places, 581 transitions, 1171 flow [2023-11-29 01:34:00,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1171, PETRI_PLACES=575, PETRI_TRANSITIONS=581} [2023-11-29 01:34:00,920 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -26 predicate places. [2023-11-29 01:34:00,921 INFO L495 AbstractCegarLoop]: Abstraction has has 575 places, 581 transitions, 1171 flow [2023-11-29 01:34:00,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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:34:00,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:00,922 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] [2023-11-29 01:34:00,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:34:00,922 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:00,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:00,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1681927513, now seen corresponding path program 1 times [2023-11-29 01:34:00,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:00,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783934907] [2023-11-29 01:34:00,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:00,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:00,972 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:34:00,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:00,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783934907] [2023-11-29 01:34:00,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783934907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:00,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:00,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:00,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030135725] [2023-11-29 01:34:00,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:00,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:00,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:00,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:01,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 652 [2023-11-29 01:34:01,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 581 transitions, 1171 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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:34:01,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:01,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 652 [2023-11-29 01:34:01,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:01,360 INFO L124 PetriNetUnfolderBase]: 63/1810 cut-off events. [2023-11-29 01:34:01,360 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 01:34:01,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1879 conditions, 1810 events. 63/1810 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 10333 event pairs, 20 based on Foata normal form. 0/1559 useless extension candidates. Maximal degree in co-relation 1829. Up to 50 conditions per place. [2023-11-29 01:34:01,384 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 13 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2023-11-29 01:34:01,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 580 transitions, 1199 flow [2023-11-29 01:34:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2023-11-29 01:34:01,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9514314928425358 [2023-11-29 01:34:01,390 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1861 transitions. [2023-11-29 01:34:01,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1861 transitions. [2023-11-29 01:34:01,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:01,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1861 transitions. [2023-11-29 01:34:01,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 620.3333333333334) internal successors, (1861), 3 states have internal predecessors, (1861), 0 states have call successors, (0), 0 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:34:01,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:01,401 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:01,401 INFO L175 Difference]: Start difference. First operand has 575 places, 581 transitions, 1171 flow. Second operand 3 states and 1861 transitions. [2023-11-29 01:34:01,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 580 transitions, 1199 flow [2023-11-29 01:34:01,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 580 transitions, 1198 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:34:01,414 INFO L231 Difference]: Finished difference. Result has 575 places, 580 transitions, 1172 flow [2023-11-29 01:34:01,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1172, PETRI_PLACES=575, PETRI_TRANSITIONS=580} [2023-11-29 01:34:01,416 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -26 predicate places. [2023-11-29 01:34:01,416 INFO L495 AbstractCegarLoop]: Abstraction has has 575 places, 580 transitions, 1172 flow [2023-11-29 01:34:01,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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:34:01,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:01,417 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] [2023-11-29 01:34:01,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:34:01,417 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:01,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:01,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1062855488, now seen corresponding path program 1 times [2023-11-29 01:34:01,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:01,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437583173] [2023-11-29 01:34:01,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:01,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:01,468 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:34:01,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:01,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437583173] [2023-11-29 01:34:01,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437583173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:01,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:01,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:01,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267274926] [2023-11-29 01:34:01,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:01,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:01,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:01,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:01,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 652 [2023-11-29 01:34:01,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 580 transitions, 1172 flow. Second operand has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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:34:01,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:01,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 652 [2023-11-29 01:34:01,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:02,018 INFO L124 PetriNetUnfolderBase]: 137/2458 cut-off events. [2023-11-29 01:34:02,018 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-29 01:34:02,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2614 conditions, 2458 events. 137/2458 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 17816 event pairs, 64 based on Foata normal form. 0/2126 useless extension candidates. Maximal degree in co-relation 2564. Up to 141 conditions per place. [2023-11-29 01:34:02,061 INFO L140 encePairwiseOnDemand]: 646/652 looper letters, 16 selfloop transitions, 1 changer transitions 0/575 dead transitions. [2023-11-29 01:34:02,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 575 transitions, 1196 flow [2023-11-29 01:34:02,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:02,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2023-11-29 01:34:02,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9468302658486708 [2023-11-29 01:34:02,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1852 transitions. [2023-11-29 01:34:02,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1852 transitions. [2023-11-29 01:34:02,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:02,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1852 transitions. [2023-11-29 01:34:02,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 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:34:02,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:02,077 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:02,077 INFO L175 Difference]: Start difference. First operand has 575 places, 580 transitions, 1172 flow. Second operand 3 states and 1852 transitions. [2023-11-29 01:34:02,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 575 transitions, 1196 flow [2023-11-29 01:34:02,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 575 transitions, 1192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:34:02,089 INFO L231 Difference]: Finished difference. Result has 570 places, 575 transitions, 1160 flow [2023-11-29 01:34:02,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1160, PETRI_PLACES=570, PETRI_TRANSITIONS=575} [2023-11-29 01:34:02,091 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -31 predicate places. [2023-11-29 01:34:02,091 INFO L495 AbstractCegarLoop]: Abstraction has has 570 places, 575 transitions, 1160 flow [2023-11-29 01:34:02,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 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:34:02,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:02,093 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] [2023-11-29 01:34:02,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:34:02,093 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:02,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:02,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1037046540, now seen corresponding path program 1 times [2023-11-29 01:34:02,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:02,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173833566] [2023-11-29 01:34:02,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:02,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:02,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:34:02,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:02,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173833566] [2023-11-29 01:34:02,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173833566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:02,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:02,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:02,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609875171] [2023-11-29 01:34:02,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:02,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:02,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:02,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:02,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:02,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 652 [2023-11-29 01:34:02,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 575 transitions, 1160 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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:34:02,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:02,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 652 [2023-11-29 01:34:02,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:02,417 INFO L124 PetriNetUnfolderBase]: 39/920 cut-off events. [2023-11-29 01:34:02,417 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 01:34:02,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 920 events. 39/920 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3752 event pairs, 20 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 932. Up to 50 conditions per place. [2023-11-29 01:34:02,431 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 13 selfloop transitions, 2 changer transitions 0/574 dead transitions. [2023-11-29 01:34:02,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 574 transitions, 1188 flow [2023-11-29 01:34:02,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2023-11-29 01:34:02,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9514314928425358 [2023-11-29 01:34:02,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1861 transitions. [2023-11-29 01:34:02,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1861 transitions. [2023-11-29 01:34:02,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:02,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1861 transitions. [2023-11-29 01:34:02,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 620.3333333333334) internal successors, (1861), 3 states have internal predecessors, (1861), 0 states have call successors, (0), 0 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:34:02,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:02,445 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:02,445 INFO L175 Difference]: Start difference. First operand has 570 places, 575 transitions, 1160 flow. Second operand 3 states and 1861 transitions. [2023-11-29 01:34:02,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 574 transitions, 1188 flow [2023-11-29 01:34:02,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 574 transitions, 1187 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:34:02,458 INFO L231 Difference]: Finished difference. Result has 570 places, 574 transitions, 1161 flow [2023-11-29 01:34:02,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1161, PETRI_PLACES=570, PETRI_TRANSITIONS=574} [2023-11-29 01:34:02,460 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -31 predicate places. [2023-11-29 01:34:02,460 INFO L495 AbstractCegarLoop]: Abstraction has has 570 places, 574 transitions, 1161 flow [2023-11-29 01:34:02,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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:34:02,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:02,461 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] [2023-11-29 01:34:02,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:34:02,462 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:02,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:02,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1548913754, now seen corresponding path program 1 times [2023-11-29 01:34:02,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:02,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429666350] [2023-11-29 01:34:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:02,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:02,525 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:34:02,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:02,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429666350] [2023-11-29 01:34:02,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429666350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:02,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:02,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:02,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166954005] [2023-11-29 01:34:02,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:02,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:02,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:02,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:02,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:02,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 619 out of 652 [2023-11-29 01:34:02,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 574 transitions, 1161 flow. Second operand has 3 states, 3 states have (on average 620.3333333333334) internal successors, (1861), 3 states have internal predecessors, (1861), 0 states have call successors, (0), 0 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:34:02,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:02,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 619 of 652 [2023-11-29 01:34:02,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:02,787 INFO L124 PetriNetUnfolderBase]: 35/1013 cut-off events. [2023-11-29 01:34:02,788 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 01:34:02,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 1013 events. 35/1013 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4479 event pairs, 6 based on Foata normal form. 0/898 useless extension candidates. Maximal degree in co-relation 1017. Up to 23 conditions per place. [2023-11-29 01:34:02,802 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 12 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2023-11-29 01:34:02,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 575 transitions, 1193 flow [2023-11-29 01:34:02,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2023-11-29 01:34:02,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9570552147239264 [2023-11-29 01:34:02,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1872 transitions. [2023-11-29 01:34:02,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1872 transitions. [2023-11-29 01:34:02,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:02,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1872 transitions. [2023-11-29 01:34:02,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 624.0) internal successors, (1872), 3 states have internal predecessors, (1872), 0 states have call successors, (0), 0 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:34:02,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:02,816 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:02,816 INFO L175 Difference]: Start difference. First operand has 570 places, 574 transitions, 1161 flow. Second operand 3 states and 1872 transitions. [2023-11-29 01:34:02,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 575 transitions, 1193 flow [2023-11-29 01:34:02,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 575 transitions, 1189 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:34:02,828 INFO L231 Difference]: Finished difference. Result has 569 places, 573 transitions, 1159 flow [2023-11-29 01:34:02,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1159, PETRI_PLACES=569, PETRI_TRANSITIONS=573} [2023-11-29 01:34:02,830 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -32 predicate places. [2023-11-29 01:34:02,830 INFO L495 AbstractCegarLoop]: Abstraction has has 569 places, 573 transitions, 1159 flow [2023-11-29 01:34:02,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.3333333333334) internal successors, (1861), 3 states have internal predecessors, (1861), 0 states have call successors, (0), 0 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:34:02,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:02,831 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] [2023-11-29 01:34:02,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 01:34:02,832 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:02,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:02,832 INFO L85 PathProgramCache]: Analyzing trace with hash 111260588, now seen corresponding path program 1 times [2023-11-29 01:34:02,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:02,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043924582] [2023-11-29 01:34:02,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:02,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:02,898 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:34:02,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:02,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043924582] [2023-11-29 01:34:02,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043924582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:02,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:02,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:02,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859739032] [2023-11-29 01:34:02,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:02,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:02,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:02,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:02,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:02,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 619 out of 652 [2023-11-29 01:34:02,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 573 transitions, 1159 flow. Second operand has 3 states, 3 states have (on average 620.6666666666666) internal successors, (1862), 3 states have internal predecessors, (1862), 0 states have call successors, (0), 0 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:34:02,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:02,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 619 of 652 [2023-11-29 01:34:02,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:03,111 INFO L124 PetriNetUnfolderBase]: 32/907 cut-off events. [2023-11-29 01:34:03,111 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 01:34:03,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 907 events. 32/907 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3617 event pairs, 6 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 906. Up to 23 conditions per place. [2023-11-29 01:34:03,126 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 12 selfloop transitions, 2 changer transitions 0/574 dead transitions. [2023-11-29 01:34:03,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 574 transitions, 1191 flow [2023-11-29 01:34:03,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2023-11-29 01:34:03,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9570552147239264 [2023-11-29 01:34:03,131 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1872 transitions. [2023-11-29 01:34:03,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1872 transitions. [2023-11-29 01:34:03,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:03,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1872 transitions. [2023-11-29 01:34:03,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 624.0) internal successors, (1872), 3 states have internal predecessors, (1872), 0 states have call successors, (0), 0 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:34:03,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:03,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:03,141 INFO L175 Difference]: Start difference. First operand has 569 places, 573 transitions, 1159 flow. Second operand 3 states and 1872 transitions. [2023-11-29 01:34:03,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 574 transitions, 1191 flow [2023-11-29 01:34:03,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 574 transitions, 1187 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:34:03,156 INFO L231 Difference]: Finished difference. Result has 568 places, 572 transitions, 1157 flow [2023-11-29 01:34:03,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1157, PETRI_PLACES=568, PETRI_TRANSITIONS=572} [2023-11-29 01:34:03,158 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -33 predicate places. [2023-11-29 01:34:03,158 INFO L495 AbstractCegarLoop]: Abstraction has has 568 places, 572 transitions, 1157 flow [2023-11-29 01:34:03,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.6666666666666) internal successors, (1862), 3 states have internal predecessors, (1862), 0 states have call successors, (0), 0 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:34:03,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:03,159 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] [2023-11-29 01:34:03,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 01:34:03,160 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:03,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:03,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1764599213, now seen corresponding path program 1 times [2023-11-29 01:34:03,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:03,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898869622] [2023-11-29 01:34:03,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:03,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:03,224 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:34:03,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:03,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898869622] [2023-11-29 01:34:03,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898869622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:03,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:03,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:34:03,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979762253] [2023-11-29 01:34:03,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:03,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:03,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:03,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:03,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:03,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 652 [2023-11-29 01:34:03,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 572 transitions, 1157 flow. Second operand has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 0 states have call successors, (0), 0 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:34:03,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:03,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 652 [2023-11-29 01:34:03,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:03,505 INFO L124 PetriNetUnfolderBase]: 41/1014 cut-off events. [2023-11-29 01:34:03,506 INFO L125 PetriNetUnfolderBase]: For 3/10 co-relation queries the response was YES. [2023-11-29 01:34:03,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 1014 events. 41/1014 cut-off events. For 3/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4421 event pairs, 12 based on Foata normal form. 1/899 useless extension candidates. Maximal degree in co-relation 1045. Up to 39 conditions per place. [2023-11-29 01:34:03,525 INFO L140 encePairwiseOnDemand]: 648/652 looper letters, 14 selfloop transitions, 3 changer transitions 0/575 dead transitions. [2023-11-29 01:34:03,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 575 transitions, 1199 flow [2023-11-29 01:34:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2023-11-29 01:34:03,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9570552147239264 [2023-11-29 01:34:03,529 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1872 transitions. [2023-11-29 01:34:03,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1872 transitions. [2023-11-29 01:34:03,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:03,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1872 transitions. [2023-11-29 01:34:03,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 624.0) internal successors, (1872), 3 states have internal predecessors, (1872), 0 states have call successors, (0), 0 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:34:03,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:03,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:03,538 INFO L175 Difference]: Start difference. First operand has 568 places, 572 transitions, 1157 flow. Second operand 3 states and 1872 transitions. [2023-11-29 01:34:03,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 575 transitions, 1199 flow [2023-11-29 01:34:03,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 575 transitions, 1195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:34:03,551 INFO L231 Difference]: Finished difference. Result has 570 places, 573 transitions, 1171 flow [2023-11-29 01:34:03,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1171, PETRI_PLACES=570, PETRI_TRANSITIONS=573} [2023-11-29 01:34:03,553 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -31 predicate places. [2023-11-29 01:34:03,553 INFO L495 AbstractCegarLoop]: Abstraction has has 570 places, 573 transitions, 1171 flow [2023-11-29 01:34:03,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 0 states have call successors, (0), 0 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:34:03,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:03,555 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] [2023-11-29 01:34:03,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 01:34:03,555 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:03,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1172894821, now seen corresponding path program 1 times [2023-11-29 01:34:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:03,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468255408] [2023-11-29 01:34:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:04,124 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:34:04,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:04,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468255408] [2023-11-29 01:34:04,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468255408] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:04,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:04,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:34:04,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976901163] [2023-11-29 01:34:04,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:04,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:34:04,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:04,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:34:04,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:05,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 604 out of 652 [2023-11-29 01:34:05,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 573 transitions, 1171 flow. Second operand has 6 states, 6 states have (on average 605.6666666666666) internal successors, (3634), 6 states have internal predecessors, (3634), 0 states have call successors, (0), 0 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:34:05,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:05,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 604 of 652 [2023-11-29 01:34:05,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:05,134 INFO L124 PetriNetUnfolderBase]: 13/572 cut-off events. [2023-11-29 01:34:05,134 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 01:34:05,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 572 events. 13/572 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1344 event pairs, 0 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 563. Up to 18 conditions per place. [2023-11-29 01:34:05,141 INFO L140 encePairwiseOnDemand]: 647/652 looper letters, 21 selfloop transitions, 4 changer transitions 0/572 dead transitions. [2023-11-29 01:34:05,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 572 transitions, 1219 flow [2023-11-29 01:34:05,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:34:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:34:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3650 transitions. [2023-11-29 01:34:05,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9330265848670757 [2023-11-29 01:34:05,149 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3650 transitions. [2023-11-29 01:34:05,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3650 transitions. [2023-11-29 01:34:05,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:05,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3650 transitions. [2023-11-29 01:34:05,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 608.3333333333334) internal successors, (3650), 6 states have internal predecessors, (3650), 0 states have call successors, (0), 0 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:34:05,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:05,160 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:05,160 INFO L175 Difference]: Start difference. First operand has 570 places, 573 transitions, 1171 flow. Second operand 6 states and 3650 transitions. [2023-11-29 01:34:05,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 572 transitions, 1219 flow [2023-11-29 01:34:05,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 572 transitions, 1213 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:34:05,169 INFO L231 Difference]: Finished difference. Result has 572 places, 572 transitions, 1171 flow [2023-11-29 01:34:05,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1171, PETRI_PLACES=572, PETRI_TRANSITIONS=572} [2023-11-29 01:34:05,170 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -29 predicate places. [2023-11-29 01:34:05,170 INFO L495 AbstractCegarLoop]: Abstraction has has 572 places, 572 transitions, 1171 flow [2023-11-29 01:34:05,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 605.6666666666666) internal successors, (3634), 6 states have internal predecessors, (3634), 0 states have call successors, (0), 0 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:34:05,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:05,171 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] [2023-11-29 01:34:05,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 01:34:05,172 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:05,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:05,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1780015591, now seen corresponding path program 1 times [2023-11-29 01:34:05,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:05,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858777360] [2023-11-29 01:34:05,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:05,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:05,229 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:34:05,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:05,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858777360] [2023-11-29 01:34:05,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858777360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:05,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:05,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:05,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464310940] [2023-11-29 01:34:05,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:05,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:05,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:05,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:05,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:05,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 619 out of 652 [2023-11-29 01:34:05,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 572 transitions, 1171 flow. Second operand has 3 states, 3 states have (on average 621.0) internal successors, (1863), 3 states have internal predecessors, (1863), 0 states have call successors, (0), 0 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:34:05,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:05,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 619 of 652 [2023-11-29 01:34:05,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:05,376 INFO L124 PetriNetUnfolderBase]: 29/781 cut-off events. [2023-11-29 01:34:05,376 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 01:34:05,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 781 events. 29/781 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2740 event pairs, 6 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 782. Up to 23 conditions per place. [2023-11-29 01:34:05,385 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 12 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2023-11-29 01:34:05,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 573 transitions, 1203 flow [2023-11-29 01:34:05,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2023-11-29 01:34:05,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9570552147239264 [2023-11-29 01:34:05,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1872 transitions. [2023-11-29 01:34:05,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1872 transitions. [2023-11-29 01:34:05,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:05,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1872 transitions. [2023-11-29 01:34:05,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 624.0) internal successors, (1872), 3 states have internal predecessors, (1872), 0 states have call successors, (0), 0 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:34:05,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:05,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:05,397 INFO L175 Difference]: Start difference. First operand has 572 places, 572 transitions, 1171 flow. Second operand 3 states and 1872 transitions. [2023-11-29 01:34:05,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 573 transitions, 1203 flow [2023-11-29 01:34:05,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 573 transitions, 1196 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 01:34:05,405 INFO L231 Difference]: Finished difference. Result has 569 places, 571 transitions, 1166 flow [2023-11-29 01:34:05,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=569, PETRI_TRANSITIONS=571} [2023-11-29 01:34:05,406 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -32 predicate places. [2023-11-29 01:34:05,407 INFO L495 AbstractCegarLoop]: Abstraction has has 569 places, 571 transitions, 1166 flow [2023-11-29 01:34:05,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 621.0) internal successors, (1863), 3 states have internal predecessors, (1863), 0 states have call successors, (0), 0 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:34:05,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:05,407 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] [2023-11-29 01:34:05,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 01:34:05,408 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:05,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1944768564, now seen corresponding path program 1 times [2023-11-29 01:34:05,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:05,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040056850] [2023-11-29 01:34:05,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:05,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:05,462 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:34:05,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:05,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040056850] [2023-11-29 01:34:05,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040056850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:05,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:05,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:05,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105687] [2023-11-29 01:34:05,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:05,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:05,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:05,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:05,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:05,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 652 [2023-11-29 01:34:05,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 571 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 0 states have call successors, (0), 0 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:34:05,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:05,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 652 [2023-11-29 01:34:05,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:05,789 INFO L124 PetriNetUnfolderBase]: 86/1597 cut-off events. [2023-11-29 01:34:05,789 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-29 01:34:05,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 1597 events. 86/1597 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9279 event pairs, 12 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 1699. Up to 99 conditions per place. [2023-11-29 01:34:05,816 INFO L140 encePairwiseOnDemand]: 646/652 looper letters, 20 selfloop transitions, 2 changer transitions 0/574 dead transitions. [2023-11-29 01:34:05,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 574 transitions, 1221 flow [2023-11-29 01:34:05,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1865 transitions. [2023-11-29 01:34:05,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9534764826175869 [2023-11-29 01:34:05,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1865 transitions. [2023-11-29 01:34:05,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1865 transitions. [2023-11-29 01:34:05,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:05,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1865 transitions. [2023-11-29 01:34:05,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 621.6666666666666) internal successors, (1865), 3 states have internal predecessors, (1865), 0 states have call successors, (0), 0 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:34:05,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:05,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:05,826 INFO L175 Difference]: Start difference. First operand has 569 places, 571 transitions, 1166 flow. Second operand 3 states and 1865 transitions. [2023-11-29 01:34:05,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 574 transitions, 1221 flow [2023-11-29 01:34:05,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 574 transitions, 1217 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:34:05,835 INFO L231 Difference]: Finished difference. Result has 566 places, 569 transitions, 1168 flow [2023-11-29 01:34:05,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1168, PETRI_PLACES=566, PETRI_TRANSITIONS=569} [2023-11-29 01:34:05,836 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -35 predicate places. [2023-11-29 01:34:05,836 INFO L495 AbstractCegarLoop]: Abstraction has has 566 places, 569 transitions, 1168 flow [2023-11-29 01:34:05,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 0 states have call successors, (0), 0 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:34:05,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:05,836 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] [2023-11-29 01:34:05,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 01:34:05,837 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:05,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:05,837 INFO L85 PathProgramCache]: Analyzing trace with hash 796411904, now seen corresponding path program 1 times [2023-11-29 01:34:05,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:05,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725548929] [2023-11-29 01:34:05,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:05,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:05,893 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:34:05,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725548929] [2023-11-29 01:34:05,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725548929] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:05,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:05,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:34:05,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928048427] [2023-11-29 01:34:05,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:05,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:05,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:05,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:05,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:05,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 652 [2023-11-29 01:34:05,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 569 transitions, 1168 flow. Second operand has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 0 states have call successors, (0), 0 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:34:05,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:05,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 652 [2023-11-29 01:34:05,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:06,165 INFO L124 PetriNetUnfolderBase]: 65/1291 cut-off events. [2023-11-29 01:34:06,166 INFO L125 PetriNetUnfolderBase]: For 24/67 co-relation queries the response was YES. [2023-11-29 01:34:06,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 1291 events. 65/1291 cut-off events. For 24/67 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6799 event pairs, 18 based on Foata normal form. 2/1141 useless extension candidates. Maximal degree in co-relation 1362. Up to 57 conditions per place. [2023-11-29 01:34:06,189 INFO L140 encePairwiseOnDemand]: 648/652 looper letters, 14 selfloop transitions, 3 changer transitions 0/572 dead transitions. [2023-11-29 01:34:06,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 572 transitions, 1210 flow [2023-11-29 01:34:06,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2023-11-29 01:34:06,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9570552147239264 [2023-11-29 01:34:06,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1872 transitions. [2023-11-29 01:34:06,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1872 transitions. [2023-11-29 01:34:06,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:06,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1872 transitions. [2023-11-29 01:34:06,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 624.0) internal successors, (1872), 3 states have internal predecessors, (1872), 0 states have call successors, (0), 0 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:34:06,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:06,201 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:06,201 INFO L175 Difference]: Start difference. First operand has 566 places, 569 transitions, 1168 flow. Second operand 3 states and 1872 transitions. [2023-11-29 01:34:06,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 572 transitions, 1210 flow [2023-11-29 01:34:06,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 572 transitions, 1210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:34:06,210 INFO L231 Difference]: Finished difference. Result has 570 places, 570 transitions, 1186 flow [2023-11-29 01:34:06,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1186, PETRI_PLACES=570, PETRI_TRANSITIONS=570} [2023-11-29 01:34:06,212 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -31 predicate places. [2023-11-29 01:34:06,212 INFO L495 AbstractCegarLoop]: Abstraction has has 570 places, 570 transitions, 1186 flow [2023-11-29 01:34:06,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 0 states have call successors, (0), 0 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:34:06,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:06,212 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] [2023-11-29 01:34:06,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 01:34:06,212 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:06,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1228023162, now seen corresponding path program 1 times [2023-11-29 01:34:06,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:06,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769271401] [2023-11-29 01:34:06,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:06,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:06,259 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:34:06,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:06,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769271401] [2023-11-29 01:34:06,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769271401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:06,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:06,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:06,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827876485] [2023-11-29 01:34:06,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:06,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:06,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:06,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:06,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:06,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 652 [2023-11-29 01:34:06,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 570 transitions, 1186 flow. Second operand has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 0 states have call successors, (0), 0 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:34:06,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:06,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 652 [2023-11-29 01:34:06,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:06,777 INFO L124 PetriNetUnfolderBase]: 157/2765 cut-off events. [2023-11-29 01:34:06,777 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 01:34:06,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3102 conditions, 2765 events. 157/2765 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 20453 event pairs, 31 based on Foata normal form. 0/2473 useless extension candidates. Maximal degree in co-relation 3050. Up to 161 conditions per place. [2023-11-29 01:34:06,819 INFO L140 encePairwiseOnDemand]: 646/652 looper letters, 20 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2023-11-29 01:34:06,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 573 transitions, 1241 flow [2023-11-29 01:34:06,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1865 transitions. [2023-11-29 01:34:06,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9534764826175869 [2023-11-29 01:34:06,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1865 transitions. [2023-11-29 01:34:06,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1865 transitions. [2023-11-29 01:34:06,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:06,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1865 transitions. [2023-11-29 01:34:06,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 621.6666666666666) internal successors, (1865), 3 states have internal predecessors, (1865), 0 states have call successors, (0), 0 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:34:06,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:06,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:06,829 INFO L175 Difference]: Start difference. First operand has 570 places, 570 transitions, 1186 flow. Second operand 3 states and 1865 transitions. [2023-11-29 01:34:06,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 573 transitions, 1241 flow [2023-11-29 01:34:06,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 573 transitions, 1235 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:34:06,838 INFO L231 Difference]: Finished difference. Result has 567 places, 568 transitions, 1186 flow [2023-11-29 01:34:06,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1186, PETRI_PLACES=567, PETRI_TRANSITIONS=568} [2023-11-29 01:34:06,840 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -34 predicate places. [2023-11-29 01:34:06,840 INFO L495 AbstractCegarLoop]: Abstraction has has 567 places, 568 transitions, 1186 flow [2023-11-29 01:34:06,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 0 states have call successors, (0), 0 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:34:06,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:06,840 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] [2023-11-29 01:34:06,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 01:34:06,840 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:06,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:06,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1964119560, now seen corresponding path program 1 times [2023-11-29 01:34:06,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:06,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346656896] [2023-11-29 01:34:06,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:06,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:07,019 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:34:07,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:07,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346656896] [2023-11-29 01:34:07,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346656896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:07,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:07,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:34:07,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632579918] [2023-11-29 01:34:07,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:07,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:34:07,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:07,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:34:07,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:34:07,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 652 [2023-11-29 01:34:07,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 568 transitions, 1186 flow. Second operand has 8 states, 8 states have (on average 591.125) internal successors, (4729), 8 states have internal predecessors, (4729), 0 states have call successors, (0), 0 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:34:07,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:07,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 652 [2023-11-29 01:34:07,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:08,066 INFO L124 PetriNetUnfolderBase]: 124/1979 cut-off events. [2023-11-29 01:34:08,066 INFO L125 PetriNetUnfolderBase]: For 24/56 co-relation queries the response was YES. [2023-11-29 01:34:08,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2440 conditions, 1979 events. 124/1979 cut-off events. For 24/56 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 11879 event pairs, 45 based on Foata normal form. 5/1818 useless extension candidates. Maximal degree in co-relation 2386. Up to 186 conditions per place. [2023-11-29 01:34:08,098 INFO L140 encePairwiseOnDemand]: 638/652 looper letters, 69 selfloop transitions, 15 changer transitions 0/606 dead transitions. [2023-11-29 01:34:08,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 606 transitions, 1446 flow [2023-11-29 01:34:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:34:08,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 01:34:08,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6541 transitions. [2023-11-29 01:34:08,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9120189626324595 [2023-11-29 01:34:08,114 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6541 transitions. [2023-11-29 01:34:08,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6541 transitions. [2023-11-29 01:34:08,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:08,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6541 transitions. [2023-11-29 01:34:08,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 594.6363636363636) internal successors, (6541), 11 states have internal predecessors, (6541), 0 states have call successors, (0), 0 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:34:08,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 652.0) internal successors, (7824), 12 states have internal predecessors, (7824), 0 states have call successors, (0), 0 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:34:08,139 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 652.0) internal successors, (7824), 12 states have internal predecessors, (7824), 0 states have call successors, (0), 0 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:34:08,139 INFO L175 Difference]: Start difference. First operand has 567 places, 568 transitions, 1186 flow. Second operand 11 states and 6541 transitions. [2023-11-29 01:34:08,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 606 transitions, 1446 flow [2023-11-29 01:34:08,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 606 transitions, 1446 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:34:08,151 INFO L231 Difference]: Finished difference. Result has 582 places, 576 transitions, 1262 flow [2023-11-29 01:34:08,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1262, PETRI_PLACES=582, PETRI_TRANSITIONS=576} [2023-11-29 01:34:08,152 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -19 predicate places. [2023-11-29 01:34:08,152 INFO L495 AbstractCegarLoop]: Abstraction has has 582 places, 576 transitions, 1262 flow [2023-11-29 01:34:08,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 591.125) internal successors, (4729), 8 states have internal predecessors, (4729), 0 states have call successors, (0), 0 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:34:08,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:08,154 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] [2023-11-29 01:34:08,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 01:34:08,154 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:08,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1034054178, now seen corresponding path program 1 times [2023-11-29 01:34:08,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:08,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637527990] [2023-11-29 01:34:08,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:08,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:08,329 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:34:08,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:08,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637527990] [2023-11-29 01:34:08,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637527990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:08,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:08,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:34:08,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246573404] [2023-11-29 01:34:08,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:08,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:34:08,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:08,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:34:08,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:34:08,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 652 [2023-11-29 01:34:08,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 576 transitions, 1262 flow. Second operand has 8 states, 8 states have (on average 591.25) internal successors, (4730), 8 states have internal predecessors, (4730), 0 states have call successors, (0), 0 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:34:08,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:08,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 652 [2023-11-29 01:34:08,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:09,957 INFO L124 PetriNetUnfolderBase]: 276/4012 cut-off events. [2023-11-29 01:34:09,957 INFO L125 PetriNetUnfolderBase]: For 144/192 co-relation queries the response was YES. [2023-11-29 01:34:10,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4875 conditions, 4012 events. 276/4012 cut-off events. For 144/192 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 34963 event pairs, 98 based on Foata normal form. 8/3619 useless extension candidates. Maximal degree in co-relation 4812. Up to 314 conditions per place. [2023-11-29 01:34:10,033 INFO L140 encePairwiseOnDemand]: 638/652 looper letters, 65 selfloop transitions, 15 changer transitions 0/605 dead transitions. [2023-11-29 01:34:10,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 605 transitions, 1496 flow [2023-11-29 01:34:10,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:34:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 01:34:10,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6532 transitions. [2023-11-29 01:34:10,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9107640825432236 [2023-11-29 01:34:10,048 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6532 transitions. [2023-11-29 01:34:10,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6532 transitions. [2023-11-29 01:34:10,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:10,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6532 transitions. [2023-11-29 01:34:10,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 593.8181818181819) internal successors, (6532), 11 states have internal predecessors, (6532), 0 states have call successors, (0), 0 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:34:10,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 652.0) internal successors, (7824), 12 states have internal predecessors, (7824), 0 states have call successors, (0), 0 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:34:10,062 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 652.0) internal successors, (7824), 12 states have internal predecessors, (7824), 0 states have call successors, (0), 0 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:34:10,063 INFO L175 Difference]: Start difference. First operand has 582 places, 576 transitions, 1262 flow. Second operand 11 states and 6532 transitions. [2023-11-29 01:34:10,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 605 transitions, 1496 flow [2023-11-29 01:34:10,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 605 transitions, 1492 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:34:10,073 INFO L231 Difference]: Finished difference. Result has 596 places, 584 transitions, 1334 flow [2023-11-29 01:34:10,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1334, PETRI_PLACES=596, PETRI_TRANSITIONS=584} [2023-11-29 01:34:10,074 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -5 predicate places. [2023-11-29 01:34:10,074 INFO L495 AbstractCegarLoop]: Abstraction has has 596 places, 584 transitions, 1334 flow [2023-11-29 01:34:10,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 591.25) internal successors, (4730), 8 states have internal predecessors, (4730), 0 states have call successors, (0), 0 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:34:10,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:10,075 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] [2023-11-29 01:34:10,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 01:34:10,075 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:10,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:10,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1346974122, now seen corresponding path program 1 times [2023-11-29 01:34:10,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:10,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207510093] [2023-11-29 01:34:10,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:10,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,122 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:34:10,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:10,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207510093] [2023-11-29 01:34:10,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207510093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:10,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:10,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:34:10,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631606564] [2023-11-29 01:34:10,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:10,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:10,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:10,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:10,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:10,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 652 [2023-11-29 01:34:10,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 584 transitions, 1334 flow. Second operand has 3 states, 3 states have (on average 620.3333333333334) internal successors, (1861), 3 states have internal predecessors, (1861), 0 states have call successors, (0), 0 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:34:10,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:10,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 652 [2023-11-29 01:34:10,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:11,023 INFO L124 PetriNetUnfolderBase]: 365/3807 cut-off events. [2023-11-29 01:34:11,023 INFO L125 PetriNetUnfolderBase]: For 283/358 co-relation queries the response was YES. [2023-11-29 01:34:11,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4701 conditions, 3807 events. 365/3807 cut-off events. For 283/358 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 32780 event pairs, 144 based on Foata normal form. 8/3363 useless extension candidates. Maximal degree in co-relation 4633. Up to 419 conditions per place. [2023-11-29 01:34:11,082 INFO L140 encePairwiseOnDemand]: 648/652 looper letters, 14 selfloop transitions, 3 changer transitions 0/587 dead transitions. [2023-11-29 01:34:11,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 587 transitions, 1376 flow [2023-11-29 01:34:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2023-11-29 01:34:11,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9570552147239264 [2023-11-29 01:34:11,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1872 transitions. [2023-11-29 01:34:11,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1872 transitions. [2023-11-29 01:34:11,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:11,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1872 transitions. [2023-11-29 01:34:11,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 624.0) internal successors, (1872), 3 states have internal predecessors, (1872), 0 states have call successors, (0), 0 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:34:11,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:11,091 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:11,091 INFO L175 Difference]: Start difference. First operand has 596 places, 584 transitions, 1334 flow. Second operand 3 states and 1872 transitions. [2023-11-29 01:34:11,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 587 transitions, 1376 flow [2023-11-29 01:34:11,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 587 transitions, 1372 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:34:11,101 INFO L231 Difference]: Finished difference. Result has 599 places, 585 transitions, 1348 flow [2023-11-29 01:34:11,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1348, PETRI_PLACES=599, PETRI_TRANSITIONS=585} [2023-11-29 01:34:11,103 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -2 predicate places. [2023-11-29 01:34:11,103 INFO L495 AbstractCegarLoop]: Abstraction has has 599 places, 585 transitions, 1348 flow [2023-11-29 01:34:11,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.3333333333334) internal successors, (1861), 3 states have internal predecessors, (1861), 0 states have call successors, (0), 0 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:34:11,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:11,104 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] [2023-11-29 01:34:11,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 01:34:11,104 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:11,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:11,104 INFO L85 PathProgramCache]: Analyzing trace with hash -948617109, now seen corresponding path program 1 times [2023-11-29 01:34:11,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:11,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306187891] [2023-11-29 01:34:11,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:11,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:11,306 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:34:11,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:11,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306187891] [2023-11-29 01:34:11,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306187891] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:11,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:11,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:34:11,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973876155] [2023-11-29 01:34:11,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:11,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:34:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:11,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:34:11,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:34:11,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 652 [2023-11-29 01:34:11,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 585 transitions, 1348 flow. Second operand has 8 states, 8 states have (on average 591.375) internal successors, (4731), 8 states have internal predecessors, (4731), 0 states have call successors, (0), 0 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:34:11,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:11,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 652 [2023-11-29 01:34:11,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:13,122 INFO L124 PetriNetUnfolderBase]: 299/3637 cut-off events. [2023-11-29 01:34:13,122 INFO L125 PetriNetUnfolderBase]: For 316/352 co-relation queries the response was YES. [2023-11-29 01:34:13,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4708 conditions, 3637 events. 299/3637 cut-off events. For 316/352 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 29288 event pairs, 139 based on Foata normal form. 7/3308 useless extension candidates. Maximal degree in co-relation 4638. Up to 468 conditions per place. [2023-11-29 01:34:13,181 INFO L140 encePairwiseOnDemand]: 638/652 looper letters, 79 selfloop transitions, 15 changer transitions 0/623 dead transitions. [2023-11-29 01:34:13,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 623 transitions, 1662 flow [2023-11-29 01:34:13,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:34:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 01:34:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6541 transitions. [2023-11-29 01:34:13,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9120189626324595 [2023-11-29 01:34:13,195 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6541 transitions. [2023-11-29 01:34:13,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6541 transitions. [2023-11-29 01:34:13,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:13,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6541 transitions. [2023-11-29 01:34:13,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 594.6363636363636) internal successors, (6541), 11 states have internal predecessors, (6541), 0 states have call successors, (0), 0 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:34:13,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 652.0) internal successors, (7824), 12 states have internal predecessors, (7824), 0 states have call successors, (0), 0 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:34:13,217 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 652.0) internal successors, (7824), 12 states have internal predecessors, (7824), 0 states have call successors, (0), 0 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:34:13,217 INFO L175 Difference]: Start difference. First operand has 599 places, 585 transitions, 1348 flow. Second operand 11 states and 6541 transitions. [2023-11-29 01:34:13,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 623 transitions, 1662 flow [2023-11-29 01:34:13,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 623 transitions, 1652 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:34:13,228 INFO L231 Difference]: Finished difference. Result has 610 places, 588 transitions, 1397 flow [2023-11-29 01:34:13,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1397, PETRI_PLACES=610, PETRI_TRANSITIONS=588} [2023-11-29 01:34:13,230 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 9 predicate places. [2023-11-29 01:34:13,230 INFO L495 AbstractCegarLoop]: Abstraction has has 610 places, 588 transitions, 1397 flow [2023-11-29 01:34:13,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 591.375) internal successors, (4731), 8 states have internal predecessors, (4731), 0 states have call successors, (0), 0 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:34:13,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:13,231 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] [2023-11-29 01:34:13,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 01:34:13,231 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:13,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1696504057, now seen corresponding path program 1 times [2023-11-29 01:34:13,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:13,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633704958] [2023-11-29 01:34:13,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:13,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:34:13,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:13,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633704958] [2023-11-29 01:34:13,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633704958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:13,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:13,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:34:13,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736339354] [2023-11-29 01:34:13,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:13,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:34:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:13,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:34:13,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:34:13,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 652 [2023-11-29 01:34:13,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 588 transitions, 1397 flow. Second operand has 8 states, 8 states have (on average 591.25) internal successors, (4730), 8 states have internal predecessors, (4730), 0 states have call successors, (0), 0 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:34:13,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:13,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 652 [2023-11-29 01:34:13,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:14,602 INFO L124 PetriNetUnfolderBase]: 162/2824 cut-off events. [2023-11-29 01:34:14,602 INFO L125 PetriNetUnfolderBase]: For 168/215 co-relation queries the response was YES. [2023-11-29 01:34:14,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3782 conditions, 2824 events. 162/2824 cut-off events. For 168/215 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 19218 event pairs, 51 based on Foata normal form. 5/2628 useless extension candidates. Maximal degree in co-relation 3706. Up to 184 conditions per place. [2023-11-29 01:34:14,660 INFO L140 encePairwiseOnDemand]: 636/652 looper letters, 69 selfloop transitions, 22 changer transitions 0/620 dead transitions. [2023-11-29 01:34:14,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 620 transitions, 1685 flow [2023-11-29 01:34:14,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:34:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 01:34:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7124 transitions. [2023-11-29 01:34:14,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9105316973415133 [2023-11-29 01:34:14,670 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 7124 transitions. [2023-11-29 01:34:14,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 7124 transitions. [2023-11-29 01:34:14,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:14,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 7124 transitions. [2023-11-29 01:34:14,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 593.6666666666666) internal successors, (7124), 12 states have internal predecessors, (7124), 0 states have call successors, (0), 0 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:34:14,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 652.0) internal successors, (8476), 13 states have internal predecessors, (8476), 0 states have call successors, (0), 0 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:34:14,686 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 652.0) internal successors, (8476), 13 states have internal predecessors, (8476), 0 states have call successors, (0), 0 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:34:14,686 INFO L175 Difference]: Start difference. First operand has 610 places, 588 transitions, 1397 flow. Second operand 12 states and 7124 transitions. [2023-11-29 01:34:14,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 620 transitions, 1685 flow [2023-11-29 01:34:14,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 620 transitions, 1664 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-29 01:34:14,702 INFO L231 Difference]: Finished difference. Result has 618 places, 595 transitions, 1487 flow [2023-11-29 01:34:14,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1487, PETRI_PLACES=618, PETRI_TRANSITIONS=595} [2023-11-29 01:34:14,703 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 17 predicate places. [2023-11-29 01:34:14,703 INFO L495 AbstractCegarLoop]: Abstraction has has 618 places, 595 transitions, 1487 flow [2023-11-29 01:34:14,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 591.25) internal successors, (4730), 8 states have internal predecessors, (4730), 0 states have call successors, (0), 0 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:34:14,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:14,704 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] [2023-11-29 01:34:14,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 01:34:14,704 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:14,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:14,705 INFO L85 PathProgramCache]: Analyzing trace with hash 592370678, now seen corresponding path program 1 times [2023-11-29 01:34:14,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:14,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127497427] [2023-11-29 01:34:14,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:14,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:15,184 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:34:15,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:15,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127497427] [2023-11-29 01:34:15,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127497427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:15,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:15,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:34:15,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908486907] [2023-11-29 01:34:15,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:15,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:34:15,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:15,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:34:15,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:15,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 604 out of 652 [2023-11-29 01:34:15,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 595 transitions, 1487 flow. Second operand has 6 states, 6 states have (on average 605.8333333333334) internal successors, (3635), 6 states have internal predecessors, (3635), 0 states have call successors, (0), 0 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:34:15,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:15,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 604 of 652 [2023-11-29 01:34:15,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:16,396 INFO L124 PetriNetUnfolderBase]: 60/1901 cut-off events. [2023-11-29 01:34:16,396 INFO L125 PetriNetUnfolderBase]: For 128/145 co-relation queries the response was YES. [2023-11-29 01:34:16,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2414 conditions, 1901 events. 60/1901 cut-off events. For 128/145 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 10587 event pairs, 0 based on Foata normal form. 8/1783 useless extension candidates. Maximal degree in co-relation 2332. Up to 63 conditions per place. [2023-11-29 01:34:16,425 INFO L140 encePairwiseOnDemand]: 647/652 looper letters, 21 selfloop transitions, 4 changer transitions 0/594 dead transitions. [2023-11-29 01:34:16,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 594 transitions, 1535 flow [2023-11-29 01:34:16,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:34:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:34:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3650 transitions. [2023-11-29 01:34:16,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9330265848670757 [2023-11-29 01:34:16,430 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3650 transitions. [2023-11-29 01:34:16,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3650 transitions. [2023-11-29 01:34:16,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:16,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3650 transitions. [2023-11-29 01:34:16,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 608.3333333333334) internal successors, (3650), 6 states have internal predecessors, (3650), 0 states have call successors, (0), 0 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:34:16,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:16,439 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:16,439 INFO L175 Difference]: Start difference. First operand has 618 places, 595 transitions, 1487 flow. Second operand 6 states and 3650 transitions. [2023-11-29 01:34:16,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 594 transitions, 1535 flow [2023-11-29 01:34:16,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 594 transitions, 1518 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 01:34:16,452 INFO L231 Difference]: Finished difference. Result has 616 places, 594 transitions, 1476 flow [2023-11-29 01:34:16,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1476, PETRI_PLACES=616, PETRI_TRANSITIONS=594} [2023-11-29 01:34:16,453 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 15 predicate places. [2023-11-29 01:34:16,453 INFO L495 AbstractCegarLoop]: Abstraction has has 616 places, 594 transitions, 1476 flow [2023-11-29 01:34:16,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 605.8333333333334) internal successors, (3635), 6 states have internal predecessors, (3635), 0 states have call successors, (0), 0 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:34:16,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:16,454 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] [2023-11-29 01:34:16,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 01:34:16,454 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:16,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:16,455 INFO L85 PathProgramCache]: Analyzing trace with hash -808473882, now seen corresponding path program 1 times [2023-11-29 01:34:16,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:16,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345337708] [2023-11-29 01:34:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:16,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:34:16,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:16,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345337708] [2023-11-29 01:34:16,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345337708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:16,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:16,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:34:16,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163710239] [2023-11-29 01:34:16,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:16,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:34:16,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:16,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:34:16,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:34:17,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 652 [2023-11-29 01:34:17,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 594 transitions, 1476 flow. Second operand has 8 states, 8 states have (on average 591.375) internal successors, (4731), 8 states have internal predecessors, (4731), 0 states have call successors, (0), 0 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:34:17,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:17,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 652 [2023-11-29 01:34:17,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:18,652 INFO L124 PetriNetUnfolderBase]: 311/4088 cut-off events. [2023-11-29 01:34:18,652 INFO L125 PetriNetUnfolderBase]: For 470/490 co-relation queries the response was YES. [2023-11-29 01:34:18,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5671 conditions, 4088 events. 311/4088 cut-off events. For 470/490 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 34922 event pairs, 112 based on Foata normal form. 0/3781 useless extension candidates. Maximal degree in co-relation 5588. Up to 387 conditions per place. [2023-11-29 01:34:18,731 INFO L140 encePairwiseOnDemand]: 637/652 looper letters, 67 selfloop transitions, 18 changer transitions 0/620 dead transitions. [2023-11-29 01:34:18,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 620 transitions, 1738 flow [2023-11-29 01:34:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:34:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 01:34:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6525 transitions. [2023-11-29 01:34:18,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9097880646960401 [2023-11-29 01:34:18,739 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6525 transitions. [2023-11-29 01:34:18,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6525 transitions. [2023-11-29 01:34:18,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:18,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6525 transitions. [2023-11-29 01:34:18,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 593.1818181818181) internal successors, (6525), 11 states have internal predecessors, (6525), 0 states have call successors, (0), 0 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:34:18,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 652.0) internal successors, (7824), 12 states have internal predecessors, (7824), 0 states have call successors, (0), 0 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:34:18,754 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 652.0) internal successors, (7824), 12 states have internal predecessors, (7824), 0 states have call successors, (0), 0 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:34:18,755 INFO L175 Difference]: Start difference. First operand has 616 places, 594 transitions, 1476 flow. Second operand 11 states and 6525 transitions. [2023-11-29 01:34:18,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 620 transitions, 1738 flow [2023-11-29 01:34:18,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 620 transitions, 1731 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 01:34:18,770 INFO L231 Difference]: Finished difference. Result has 627 places, 605 transitions, 1585 flow [2023-11-29 01:34:18,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1585, PETRI_PLACES=627, PETRI_TRANSITIONS=605} [2023-11-29 01:34:18,771 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 26 predicate places. [2023-11-29 01:34:18,771 INFO L495 AbstractCegarLoop]: Abstraction has has 627 places, 605 transitions, 1585 flow [2023-11-29 01:34:18,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 591.375) internal successors, (4731), 8 states have internal predecessors, (4731), 0 states have call successors, (0), 0 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:34:18,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:18,772 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] [2023-11-29 01:34:18,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 01:34:18,773 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:18,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:18,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1992466170, now seen corresponding path program 1 times [2023-11-29 01:34:18,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:18,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28820990] [2023-11-29 01:34:18,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:18,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:34:19,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:19,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28820990] [2023-11-29 01:34:19,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28820990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:19,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:19,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:34:19,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318270929] [2023-11-29 01:34:19,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:19,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:34:19,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:19,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:34:19,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:34:19,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 652 [2023-11-29 01:34:19,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 605 transitions, 1585 flow. Second operand has 8 states, 8 states have (on average 591.5) internal successors, (4732), 8 states have internal predecessors, (4732), 0 states have call successors, (0), 0 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:34:19,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:19,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 652 [2023-11-29 01:34:19,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:20,654 INFO L124 PetriNetUnfolderBase]: 335/4070 cut-off events. [2023-11-29 01:34:20,654 INFO L125 PetriNetUnfolderBase]: For 686/726 co-relation queries the response was YES. [2023-11-29 01:34:20,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5710 conditions, 4070 events. 335/4070 cut-off events. For 686/726 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 33929 event pairs, 164 based on Foata normal form. 4/3747 useless extension candidates. Maximal degree in co-relation 5619. Up to 482 conditions per place. [2023-11-29 01:34:20,715 INFO L140 encePairwiseOnDemand]: 637/652 looper letters, 67 selfloop transitions, 18 changer transitions 0/626 dead transitions. [2023-11-29 01:34:20,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 626 transitions, 1837 flow [2023-11-29 01:34:20,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:34:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 01:34:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6525 transitions. [2023-11-29 01:34:20,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9097880646960401 [2023-11-29 01:34:20,723 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6525 transitions. [2023-11-29 01:34:20,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6525 transitions. [2023-11-29 01:34:20,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:20,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6525 transitions. [2023-11-29 01:34:20,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 593.1818181818181) internal successors, (6525), 11 states have internal predecessors, (6525), 0 states have call successors, (0), 0 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:34:20,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 652.0) internal successors, (7824), 12 states have internal predecessors, (7824), 0 states have call successors, (0), 0 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:34:20,739 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 652.0) internal successors, (7824), 12 states have internal predecessors, (7824), 0 states have call successors, (0), 0 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:34:20,739 INFO L175 Difference]: Start difference. First operand has 627 places, 605 transitions, 1585 flow. Second operand 11 states and 6525 transitions. [2023-11-29 01:34:20,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 626 transitions, 1837 flow [2023-11-29 01:34:20,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 626 transitions, 1833 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:34:20,757 INFO L231 Difference]: Finished difference. Result has 639 places, 611 transitions, 1676 flow [2023-11-29 01:34:20,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1581, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1676, PETRI_PLACES=639, PETRI_TRANSITIONS=611} [2023-11-29 01:34:20,759 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 38 predicate places. [2023-11-29 01:34:20,759 INFO L495 AbstractCegarLoop]: Abstraction has has 639 places, 611 transitions, 1676 flow [2023-11-29 01:34:20,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 591.5) internal successors, (4732), 8 states have internal predecessors, (4732), 0 states have call successors, (0), 0 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:34:20,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:20,760 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] [2023-11-29 01:34:20,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 01:34:20,760 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:20,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash -448444399, now seen corresponding path program 1 times [2023-11-29 01:34:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:20,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749306221] [2023-11-29 01:34:20,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:20,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 01:34:21,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:21,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749306221] [2023-11-29 01:34:21,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749306221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:21,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:21,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:34:21,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332989104] [2023-11-29 01:34:21,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:21,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:34:21,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:21,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:34:21,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:21,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 652 [2023-11-29 01:34:21,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 611 transitions, 1676 flow. Second operand has 6 states, 6 states have (on average 600.8333333333334) internal successors, (3605), 6 states have internal predecessors, (3605), 0 states have call successors, (0), 0 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:34:21,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:21,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 652 [2023-11-29 01:34:21,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:22,991 INFO L124 PetriNetUnfolderBase]: 183/3694 cut-off events. [2023-11-29 01:34:22,992 INFO L125 PetriNetUnfolderBase]: For 662/680 co-relation queries the response was YES. [2023-11-29 01:34:23,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5274 conditions, 3694 events. 183/3694 cut-off events. For 662/680 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 27220 event pairs, 23 based on Foata normal form. 4/3494 useless extension candidates. Maximal degree in co-relation 5179. Up to 177 conditions per place. [2023-11-29 01:34:23,051 INFO L140 encePairwiseOnDemand]: 645/652 looper letters, 41 selfloop transitions, 5 changer transitions 0/620 dead transitions. [2023-11-29 01:34:23,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 620 transitions, 1797 flow [2023-11-29 01:34:23,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:34:23,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:34:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3633 transitions. [2023-11-29 01:34:23,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.928680981595092 [2023-11-29 01:34:23,056 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3633 transitions. [2023-11-29 01:34:23,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3633 transitions. [2023-11-29 01:34:23,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:23,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3633 transitions. [2023-11-29 01:34:23,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 605.5) internal successors, (3633), 6 states have internal predecessors, (3633), 0 states have call successors, (0), 0 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:34:23,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:23,064 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:23,064 INFO L175 Difference]: Start difference. First operand has 639 places, 611 transitions, 1676 flow. Second operand 6 states and 3633 transitions. [2023-11-29 01:34:23,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 620 transitions, 1797 flow [2023-11-29 01:34:23,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 620 transitions, 1776 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-29 01:34:23,079 INFO L231 Difference]: Finished difference. Result has 635 places, 609 transitions, 1661 flow [2023-11-29 01:34:23,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1661, PETRI_PLACES=635, PETRI_TRANSITIONS=609} [2023-11-29 01:34:23,081 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 34 predicate places. [2023-11-29 01:34:23,081 INFO L495 AbstractCegarLoop]: Abstraction has has 635 places, 609 transitions, 1661 flow [2023-11-29 01:34:23,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.8333333333334) internal successors, (3605), 6 states have internal predecessors, (3605), 0 states have call successors, (0), 0 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:34:23,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:23,082 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] [2023-11-29 01:34:23,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 01:34:23,082 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:23,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:23,082 INFO L85 PathProgramCache]: Analyzing trace with hash -124511092, now seen corresponding path program 1 times [2023-11-29 01:34:23,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:23,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218464308] [2023-11-29 01:34:23,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:23,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 01:34:23,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:23,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218464308] [2023-11-29 01:34:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218464308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:23,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:23,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:34:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89960085] [2023-11-29 01:34:23,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:23,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:34:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:23,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:34:23,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:24,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 652 [2023-11-29 01:34:24,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 609 transitions, 1661 flow. Second operand has 6 states, 6 states have (on average 601.0) internal successors, (3606), 6 states have internal predecessors, (3606), 0 states have call successors, (0), 0 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:34:24,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:24,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 652 [2023-11-29 01:34:24,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:25,653 INFO L124 PetriNetUnfolderBase]: 189/4018 cut-off events. [2023-11-29 01:34:25,653 INFO L125 PetriNetUnfolderBase]: For 699/711 co-relation queries the response was YES. [2023-11-29 01:34:25,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5526 conditions, 4018 events. 189/4018 cut-off events. For 699/711 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 30665 event pairs, 28 based on Foata normal form. 0/3757 useless extension candidates. Maximal degree in co-relation 5432. Up to 195 conditions per place. [2023-11-29 01:34:25,710 INFO L140 encePairwiseOnDemand]: 645/652 looper letters, 40 selfloop transitions, 5 changer transitions 0/617 dead transitions. [2023-11-29 01:34:25,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 617 transitions, 1777 flow [2023-11-29 01:34:25,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:34:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:34:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3632 transitions. [2023-11-29 01:34:25,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9284253578732107 [2023-11-29 01:34:25,713 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3632 transitions. [2023-11-29 01:34:25,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3632 transitions. [2023-11-29 01:34:25,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:25,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3632 transitions. [2023-11-29 01:34:25,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 605.3333333333334) internal successors, (3632), 6 states have internal predecessors, (3632), 0 states have call successors, (0), 0 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:34:25,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:25,718 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:25,718 INFO L175 Difference]: Start difference. First operand has 635 places, 609 transitions, 1661 flow. Second operand 6 states and 3632 transitions. [2023-11-29 01:34:25,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 617 transitions, 1777 flow [2023-11-29 01:34:25,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 617 transitions, 1767 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:34:25,733 INFO L231 Difference]: Finished difference. Result has 633 places, 607 transitions, 1657 flow [2023-11-29 01:34:25,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1657, PETRI_PLACES=633, PETRI_TRANSITIONS=607} [2023-11-29 01:34:25,734 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 32 predicate places. [2023-11-29 01:34:25,734 INFO L495 AbstractCegarLoop]: Abstraction has has 633 places, 607 transitions, 1657 flow [2023-11-29 01:34:25,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 601.0) internal successors, (3606), 6 states have internal predecessors, (3606), 0 states have call successors, (0), 0 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:34:25,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:25,734 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] [2023-11-29 01:34:25,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 01:34:25,735 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:25,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:25,735 INFO L85 PathProgramCache]: Analyzing trace with hash 603976974, now seen corresponding path program 1 times [2023-11-29 01:34:25,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:25,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131183312] [2023-11-29 01:34:25,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:25,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 01:34:25,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:25,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131183312] [2023-11-29 01:34:25,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131183312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:25,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:25,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:25,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143122944] [2023-11-29 01:34:25,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:25,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:25,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:25,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:25,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:25,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 652 [2023-11-29 01:34:25,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 607 transitions, 1657 flow. Second operand has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 0 states have call successors, (0), 0 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:34:25,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:25,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 652 [2023-11-29 01:34:25,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:27,460 INFO L124 PetriNetUnfolderBase]: 361/6409 cut-off events. [2023-11-29 01:34:27,461 INFO L125 PetriNetUnfolderBase]: For 546/555 co-relation queries the response was YES. [2023-11-29 01:34:27,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8068 conditions, 6409 events. 361/6409 cut-off events. For 546/555 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 56914 event pairs, 58 based on Foata normal form. 0/5947 useless extension candidates. Maximal degree in co-relation 7975. Up to 385 conditions per place. [2023-11-29 01:34:27,582 INFO L140 encePairwiseOnDemand]: 646/652 looper letters, 19 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2023-11-29 01:34:27,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 609 transitions, 1707 flow [2023-11-29 01:34:27,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1864 transitions. [2023-11-29 01:34:27,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9529652351738241 [2023-11-29 01:34:27,584 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1864 transitions. [2023-11-29 01:34:27,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1864 transitions. [2023-11-29 01:34:27,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:27,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1864 transitions. [2023-11-29 01:34:27,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 621.3333333333334) internal successors, (1864), 3 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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:34:27,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:27,587 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:27,587 INFO L175 Difference]: Start difference. First operand has 633 places, 607 transitions, 1657 flow. Second operand 3 states and 1864 transitions. [2023-11-29 01:34:27,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 609 transitions, 1707 flow [2023-11-29 01:34:27,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 609 transitions, 1697 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:34:27,605 INFO L231 Difference]: Finished difference. Result has 627 places, 605 transitions, 1653 flow [2023-11-29 01:34:27,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1653, PETRI_PLACES=627, PETRI_TRANSITIONS=605} [2023-11-29 01:34:27,607 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 26 predicate places. [2023-11-29 01:34:27,607 INFO L495 AbstractCegarLoop]: Abstraction has has 627 places, 605 transitions, 1653 flow [2023-11-29 01:34:27,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 0 states have call successors, (0), 0 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:34:27,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:27,608 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] [2023-11-29 01:34:27,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 01:34:27,608 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:27,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:27,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1503176503, now seen corresponding path program 1 times [2023-11-29 01:34:27,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:27,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260576359] [2023-11-29 01:34:27,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:27,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 01:34:28,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:28,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260576359] [2023-11-29 01:34:28,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260576359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:28,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:28,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:34:28,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275289714] [2023-11-29 01:34:28,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:28,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:34:28,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:28,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:34:28,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:28,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 652 [2023-11-29 01:34:28,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 605 transitions, 1653 flow. Second operand has 6 states, 6 states have (on average 600.8333333333334) internal successors, (3605), 6 states have internal predecessors, (3605), 0 states have call successors, (0), 0 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:34:28,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:28,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 652 [2023-11-29 01:34:28,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:29,595 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1795] thread3EXIT-->L105-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][425], [Black: 700#true, Black: 894#true, Black: 770#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 707#(not |thread2Thread1of1ForFork2_#t~short11#1|), 896#(= |#race~a3~0| 0), Black: 711#true, 661#(= |#race~n2~0| 0), 798#true, Black: 843#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 835#(<= ~n3~0 0), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 836#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 849#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 899#true, 604#L105-7true, Black: 780#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 669#(= |#race~n3~0| 0), Black: 793#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 779#(<= ~n1~0 0), Black: 735#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 729#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 721#(<= ~n1~0 0), Black: 722#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 862#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 646#(= |#race~n1~0| 0), Black: 861#(<= ~n3~0 0), Black: 875#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 685#(not |thread1Thread1of1ForFork1_#t~short2#1|), 702#(= |#race~a1~0| 0), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 804#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 694#(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)), Black: 803#(<= ~n2~0 0), Black: 748#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), 828#(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: 747#(<= ~n2~0 0), Black: 761#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 753#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 755#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 713#(= |#race~a2~0| 0)]) [2023-11-29 01:34:29,595 INFO L294 olderBase$Statistics]: this new event has 351 ancestors and is not cut-off event [2023-11-29 01:34:29,595 INFO L297 olderBase$Statistics]: existing Event has 382 ancestors and is not cut-off event [2023-11-29 01:34:29,595 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:34:29,595 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:34:29,614 INFO L124 PetriNetUnfolderBase]: 200/4164 cut-off events. [2023-11-29 01:34:29,614 INFO L125 PetriNetUnfolderBase]: For 660/668 co-relation queries the response was YES. [2023-11-29 01:34:29,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5792 conditions, 4164 events. 200/4164 cut-off events. For 660/668 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 31785 event pairs, 28 based on Foata normal form. 0/3951 useless extension candidates. Maximal degree in co-relation 5698. Up to 185 conditions per place. [2023-11-29 01:34:29,671 INFO L140 encePairwiseOnDemand]: 645/652 looper letters, 41 selfloop transitions, 5 changer transitions 0/614 dead transitions. [2023-11-29 01:34:29,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 614 transitions, 1774 flow [2023-11-29 01:34:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:34:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:34:29,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3633 transitions. [2023-11-29 01:34:29,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.928680981595092 [2023-11-29 01:34:29,675 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3633 transitions. [2023-11-29 01:34:29,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3633 transitions. [2023-11-29 01:34:29,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:29,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3633 transitions. [2023-11-29 01:34:29,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 605.5) internal successors, (3633), 6 states have internal predecessors, (3633), 0 states have call successors, (0), 0 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:34:29,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:29,683 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:29,683 INFO L175 Difference]: Start difference. First operand has 627 places, 605 transitions, 1653 flow. Second operand 6 states and 3633 transitions. [2023-11-29 01:34:29,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 614 transitions, 1774 flow [2023-11-29 01:34:29,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 614 transitions, 1774 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:34:29,699 INFO L231 Difference]: Finished difference. Result has 630 places, 603 transitions, 1659 flow [2023-11-29 01:34:29,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1659, PETRI_PLACES=630, PETRI_TRANSITIONS=603} [2023-11-29 01:34:29,700 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 29 predicate places. [2023-11-29 01:34:29,700 INFO L495 AbstractCegarLoop]: Abstraction has has 630 places, 603 transitions, 1659 flow [2023-11-29 01:34:29,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.8333333333334) internal successors, (3605), 6 states have internal predecessors, (3605), 0 states have call successors, (0), 0 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:34:29,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:29,701 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] [2023-11-29 01:34:29,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 01:34:29,701 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:29,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash -681148878, now seen corresponding path program 1 times [2023-11-29 01:34:29,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:29,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062019503] [2023-11-29 01:34:29,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:29,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 01:34:30,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:30,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062019503] [2023-11-29 01:34:30,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062019503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:30,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:30,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:34:30,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193447040] [2023-11-29 01:34:30,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:30,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:34:30,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:30,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:34:30,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:30,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 652 [2023-11-29 01:34:30,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 603 transitions, 1659 flow. Second operand has 6 states, 6 states have (on average 601.1666666666666) internal successors, (3607), 6 states have internal predecessors, (3607), 0 states have call successors, (0), 0 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:34:30,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:30,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 652 [2023-11-29 01:34:30,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:31,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1794] thread2EXIT-->L104-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem47#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} AuxVars[] AssignedVars[][502], [Black: 700#true, Black: 894#true, Black: 770#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 707#(not |thread2Thread1of1ForFork2_#t~short11#1|), 210#L79-4true, 896#(= |#race~a3~0| 0), Black: 711#true, 661#(= |#race~n2~0| 0), 798#true, Black: 843#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 835#(<= ~n3~0 0), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 836#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 849#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 899#true, Black: 780#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 793#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 669#(= |#race~n3~0| 0), Black: 779#(<= ~n1~0 0), Black: 735#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 729#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 721#(<= ~n1~0 0), Black: 722#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 908#(= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0), Black: 862#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 861#(<= ~n3~0 0), 646#(= |#race~n1~0| 0), 702#(= |#race~a1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 875#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 804#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 694#(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)), Black: 803#(<= ~n2~0 0), 576#L104-7true, Black: 748#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), 828#(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: 747#(<= ~n2~0 0), Black: 761#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 753#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 713#(= |#race~a2~0| 0), Black: 755#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2023-11-29 01:34:31,729 INFO L294 olderBase$Statistics]: this new event has 348 ancestors and is cut-off event [2023-11-29 01:34:31,729 INFO L297 olderBase$Statistics]: existing Event has 348 ancestors and is cut-off event [2023-11-29 01:34:31,729 INFO L297 olderBase$Statistics]: existing Event has 348 ancestors and is cut-off event [2023-11-29 01:34:31,729 INFO L297 olderBase$Statistics]: existing Event has 317 ancestors and is cut-off event [2023-11-29 01:34:31,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1794] thread2EXIT-->L104-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem47#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} AuxVars[] AssignedVars[][507], [Black: 700#true, Black: 894#true, Black: 770#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 707#(not |thread2Thread1of1ForFork2_#t~short11#1|), 896#(= |#race~a3~0| 0), Black: 711#true, 661#(= |#race~n2~0| 0), 798#true, Black: 843#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 835#(<= ~n3~0 0), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 836#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 849#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 899#true, Black: 780#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 793#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 669#(= |#race~n3~0| 0), Black: 779#(<= ~n1~0 0), 909#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 735#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 729#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 721#(<= ~n1~0 0), Black: 722#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 862#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 861#(<= ~n3~0 0), 646#(= |#race~n1~0| 0), 702#(= |#race~a1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 875#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 804#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 694#(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)), Black: 803#(<= ~n2~0 0), 576#L104-7true, 169#L79-5true, Black: 748#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), 828#(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: 747#(<= ~n2~0 0), Black: 761#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 753#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 713#(= |#race~a2~0| 0), Black: 755#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2023-11-29 01:34:31,738 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2023-11-29 01:34:31,738 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2023-11-29 01:34:31,738 INFO L297 olderBase$Statistics]: existing Event has 318 ancestors and is cut-off event [2023-11-29 01:34:31,738 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2023-11-29 01:34:31,746 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1794] thread2EXIT-->L104-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem47#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} AuxVars[] AssignedVars[][513], [Black: 700#true, 910#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 894#true, Black: 770#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 707#(not |thread2Thread1of1ForFork2_#t~short11#1|), 896#(= |#race~a3~0| 0), Black: 711#true, 153#L79-6true, 661#(= |#race~n2~0| 0), 798#true, Black: 843#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 835#(<= ~n3~0 0), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 836#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 849#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 899#true, Black: 780#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 793#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 669#(= |#race~n3~0| 0), Black: 779#(<= ~n1~0 0), Black: 735#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 729#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 721#(<= ~n1~0 0), Black: 722#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 862#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 861#(<= ~n3~0 0), 646#(= |#race~n1~0| 0), 702#(= |#race~a1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 875#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 804#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 694#(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)), Black: 803#(<= ~n2~0 0), 576#L104-7true, Black: 748#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), 828#(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: 747#(<= ~n2~0 0), Black: 761#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 753#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 713#(= |#race~a2~0| 0), Black: 755#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2023-11-29 01:34:31,746 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2023-11-29 01:34:31,746 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2023-11-29 01:34:31,746 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2023-11-29 01:34:31,746 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2023-11-29 01:34:31,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1794] thread2EXIT-->L104-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem47#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} AuxVars[] AssignedVars[][519], [Black: 700#true, Black: 894#true, Black: 770#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 707#(not |thread2Thread1of1ForFork2_#t~short11#1|), 896#(= |#race~a3~0| 0), Black: 711#true, 661#(= |#race~n2~0| 0), 798#true, Black: 843#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 835#(<= ~n3~0 0), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 836#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 849#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 899#true, 128#L79-7true, Black: 780#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 793#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 669#(= |#race~n3~0| 0), Black: 779#(<= ~n1~0 0), Black: 735#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 729#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 721#(<= ~n1~0 0), Black: 722#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 911#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 862#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 861#(<= ~n3~0 0), 646#(= |#race~n1~0| 0), 702#(= |#race~a1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 875#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 804#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 694#(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)), Black: 803#(<= ~n2~0 0), 576#L104-7true, Black: 748#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), 828#(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: 747#(<= ~n2~0 0), Black: 761#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 753#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 713#(= |#race~a2~0| 0), Black: 755#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2023-11-29 01:34:31,755 INFO L294 olderBase$Statistics]: this new event has 351 ancestors and is cut-off event [2023-11-29 01:34:31,755 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is cut-off event [2023-11-29 01:34:31,755 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2023-11-29 01:34:31,755 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is cut-off event [2023-11-29 01:34:31,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1794] thread2EXIT-->L104-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem47#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} AuxVars[] AssignedVars[][519], [Black: 700#true, Black: 894#true, Black: 770#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 707#(not |thread2Thread1of1ForFork2_#t~short11#1|), 896#(= |#race~a3~0| 0), Black: 711#true, 661#(= |#race~n2~0| 0), 798#true, Black: 843#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 835#(<= ~n3~0 0), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 836#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 849#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 899#true, Black: 780#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 793#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 669#(= |#race~n3~0| 0), Black: 779#(<= ~n1~0 0), Black: 735#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 729#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 721#(<= ~n1~0 0), Black: 722#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 911#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 862#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 861#(<= ~n3~0 0), 646#(= |#race~n1~0| 0), 702#(= |#race~a1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 875#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 804#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 390#L79-8true, 694#(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)), Black: 803#(<= ~n2~0 0), 576#L104-7true, Black: 748#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), 828#(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: 747#(<= ~n2~0 0), Black: 761#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 753#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 713#(= |#race~a2~0| 0), Black: 755#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2023-11-29 01:34:31,763 INFO L294 olderBase$Statistics]: this new event has 352 ancestors and is cut-off event [2023-11-29 01:34:31,763 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2023-11-29 01:34:31,763 INFO L297 olderBase$Statistics]: existing Event has 352 ancestors and is cut-off event [2023-11-29 01:34:31,764 INFO L297 olderBase$Statistics]: existing Event has 352 ancestors and is cut-off event [2023-11-29 01:34:32,071 INFO L124 PetriNetUnfolderBase]: 435/5383 cut-off events. [2023-11-29 01:34:32,071 INFO L125 PetriNetUnfolderBase]: For 1042/1065 co-relation queries the response was YES. [2023-11-29 01:34:32,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7600 conditions, 5383 events. 435/5383 cut-off events. For 1042/1065 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 47289 event pairs, 49 based on Foata normal form. 4/5050 useless extension candidates. Maximal degree in co-relation 7505. Up to 316 conditions per place. [2023-11-29 01:34:32,154 INFO L140 encePairwiseOnDemand]: 645/652 looper letters, 39 selfloop transitions, 5 changer transitions 0/610 dead transitions. [2023-11-29 01:34:32,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 610 transitions, 1770 flow [2023-11-29 01:34:32,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:34:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:34:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3631 transitions. [2023-11-29 01:34:32,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9281697341513292 [2023-11-29 01:34:32,157 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3631 transitions. [2023-11-29 01:34:32,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3631 transitions. [2023-11-29 01:34:32,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:32,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3631 transitions. [2023-11-29 01:34:32,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 605.1666666666666) internal successors, (3631), 6 states have internal predecessors, (3631), 0 states have call successors, (0), 0 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:34:32,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:32,161 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:32,161 INFO L175 Difference]: Start difference. First operand has 630 places, 603 transitions, 1659 flow. Second operand 6 states and 3631 transitions. [2023-11-29 01:34:32,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 610 transitions, 1770 flow [2023-11-29 01:34:32,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 610 transitions, 1760 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:34:32,174 INFO L231 Difference]: Finished difference. Result has 628 places, 601 transitions, 1655 flow [2023-11-29 01:34:32,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1655, PETRI_PLACES=628, PETRI_TRANSITIONS=601} [2023-11-29 01:34:32,175 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 27 predicate places. [2023-11-29 01:34:32,175 INFO L495 AbstractCegarLoop]: Abstraction has has 628 places, 601 transitions, 1655 flow [2023-11-29 01:34:32,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 601.1666666666666) internal successors, (3607), 6 states have internal predecessors, (3607), 0 states have call successors, (0), 0 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:34:32,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:32,176 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] [2023-11-29 01:34:32,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 01:34:32,176 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:32,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:32,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1611692594, now seen corresponding path program 1 times [2023-11-29 01:34:32,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:32,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957524271] [2023-11-29 01:34:32,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:32,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 01:34:32,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:32,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957524271] [2023-11-29 01:34:32,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957524271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:32,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:32,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:34:32,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618913452] [2023-11-29 01:34:32,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:32,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:34:32,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:32,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:34:32,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:33,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 652 [2023-11-29 01:34:33,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 601 transitions, 1655 flow. Second operand has 6 states, 6 states have (on average 601.0) internal successors, (3606), 6 states have internal predecessors, (3606), 0 states have call successors, (0), 0 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:34:33,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:33,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 652 [2023-11-29 01:34:33,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:34,301 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1795] thread3EXIT-->L105-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][420], [Black: 700#true, Black: 894#true, Black: 770#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 707#(not |thread2Thread1of1ForFork2_#t~short11#1|), 906#true, 896#(= |#race~a3~0| 0), Black: 711#true, 661#(= |#race~n2~0| 0), 798#true, Black: 843#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 835#(<= ~n3~0 0), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 836#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 849#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 604#L105-7true, Black: 780#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 793#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 669#(= |#race~n3~0| 0), Black: 779#(<= ~n1~0 0), 913#true, Black: 735#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 729#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 721#(<= ~n1~0 0), Black: 722#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 862#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 861#(<= ~n3~0 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 875#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), 702#(= |#race~a1~0| 0), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 804#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 694#(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)), Black: 803#(<= ~n2~0 0), Black: 748#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), 828#(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: 747#(<= ~n2~0 0), Black: 761#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 753#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 755#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 713#(= |#race~a2~0| 0)]) [2023-11-29 01:34:34,301 INFO L294 olderBase$Statistics]: this new event has 351 ancestors and is not cut-off event [2023-11-29 01:34:34,301 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:34:34,301 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:34:34,301 INFO L297 olderBase$Statistics]: existing Event has 382 ancestors and is not cut-off event [2023-11-29 01:34:34,329 INFO L124 PetriNetUnfolderBase]: 204/4399 cut-off events. [2023-11-29 01:34:34,330 INFO L125 PetriNetUnfolderBase]: For 691/773 co-relation queries the response was YES. [2023-11-29 01:34:34,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6028 conditions, 4399 events. 204/4399 cut-off events. For 691/773 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 35016 event pairs, 30 based on Foata normal form. 11/4188 useless extension candidates. Maximal degree in co-relation 5933. Up to 194 conditions per place. [2023-11-29 01:34:34,409 INFO L140 encePairwiseOnDemand]: 645/652 looper letters, 40 selfloop transitions, 5 changer transitions 0/609 dead transitions. [2023-11-29 01:34:34,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 609 transitions, 1771 flow [2023-11-29 01:34:34,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:34:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:34:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3632 transitions. [2023-11-29 01:34:34,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9284253578732107 [2023-11-29 01:34:34,413 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3632 transitions. [2023-11-29 01:34:34,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3632 transitions. [2023-11-29 01:34:34,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:34,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3632 transitions. [2023-11-29 01:34:34,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 605.3333333333334) internal successors, (3632), 6 states have internal predecessors, (3632), 0 states have call successors, (0), 0 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:34:34,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:34,420 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:34,420 INFO L175 Difference]: Start difference. First operand has 628 places, 601 transitions, 1655 flow. Second operand 6 states and 3632 transitions. [2023-11-29 01:34:34,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 609 transitions, 1771 flow [2023-11-29 01:34:34,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 609 transitions, 1761 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:34:34,433 INFO L231 Difference]: Finished difference. Result has 626 places, 599 transitions, 1651 flow [2023-11-29 01:34:34,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1651, PETRI_PLACES=626, PETRI_TRANSITIONS=599} [2023-11-29 01:34:34,434 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 25 predicate places. [2023-11-29 01:34:34,434 INFO L495 AbstractCegarLoop]: Abstraction has has 626 places, 599 transitions, 1651 flow [2023-11-29 01:34:34,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 601.0) internal successors, (3606), 6 states have internal predecessors, (3606), 0 states have call successors, (0), 0 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:34:34,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:34,435 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] [2023-11-29 01:34:34,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 01:34:34,435 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:34,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash -442320113, now seen corresponding path program 1 times [2023-11-29 01:34:34,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:34,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975812815] [2023-11-29 01:34:34,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:34,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:34,876 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:34:34,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:34,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975812815] [2023-11-29 01:34:34,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975812815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:34,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:34:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469857871] [2023-11-29 01:34:34,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:34,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:34:34,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:34,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:34:34,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:35,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 604 out of 652 [2023-11-29 01:34:35,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 599 transitions, 1651 flow. Second operand has 6 states, 6 states have (on average 606.0) internal successors, (3636), 6 states have internal predecessors, (3636), 0 states have call successors, (0), 0 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:34:35,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:35,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 604 of 652 [2023-11-29 01:34:35,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:36,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1795] thread3EXIT-->L105-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][415], [Black: 700#true, Black: 894#true, Black: 770#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 707#(not |thread2Thread1of1ForFork2_#t~short11#1|), 896#(= |#race~a3~0| 0), Black: 711#true, 661#(= |#race~n2~0| 0), 798#true, Black: 843#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 835#(<= ~n3~0 0), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 836#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 849#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 604#L105-7true, Black: 780#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 793#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 669#(= |#race~n3~0| 0), Black: 779#(<= ~n1~0 0), 913#true, Black: 735#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 729#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 721#(<= ~n1~0 0), Black: 722#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 862#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 861#(<= ~n3~0 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 875#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), 702#(= |#race~a1~0| 0), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 804#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 694#(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)), Black: 803#(<= ~n2~0 0), 925#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 828#(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: 748#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 753#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 713#(= |#race~a2~0| 0), Black: 755#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2023-11-29 01:34:36,308 INFO L294 olderBase$Statistics]: this new event has 351 ancestors and is not cut-off event [2023-11-29 01:34:36,308 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:34:36,308 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:34:36,308 INFO L297 olderBase$Statistics]: existing Event has 382 ancestors and is not cut-off event [2023-11-29 01:34:36,325 INFO L124 PetriNetUnfolderBase]: 98/3085 cut-off events. [2023-11-29 01:34:36,325 INFO L125 PetriNetUnfolderBase]: For 345/360 co-relation queries the response was YES. [2023-11-29 01:34:36,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4125 conditions, 3085 events. 98/3085 cut-off events. For 345/360 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 21011 event pairs, 5 based on Foata normal form. 0/2952 useless extension candidates. Maximal degree in co-relation 4029. Up to 111 conditions per place. [2023-11-29 01:34:36,374 INFO L140 encePairwiseOnDemand]: 647/652 looper letters, 21 selfloop transitions, 4 changer transitions 0/598 dead transitions. [2023-11-29 01:34:36,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 598 transitions, 1699 flow [2023-11-29 01:34:36,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:34:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:34:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3650 transitions. [2023-11-29 01:34:36,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9330265848670757 [2023-11-29 01:34:36,377 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3650 transitions. [2023-11-29 01:34:36,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3650 transitions. [2023-11-29 01:34:36,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:36,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3650 transitions. [2023-11-29 01:34:36,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 608.3333333333334) internal successors, (3650), 6 states have internal predecessors, (3650), 0 states have call successors, (0), 0 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:34:36,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:36,382 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:36,382 INFO L175 Difference]: Start difference. First operand has 626 places, 599 transitions, 1651 flow. Second operand 6 states and 3650 transitions. [2023-11-29 01:34:36,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 598 transitions, 1699 flow [2023-11-29 01:34:36,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 598 transitions, 1689 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:34:36,393 INFO L231 Difference]: Finished difference. Result has 625 places, 598 transitions, 1647 flow [2023-11-29 01:34:36,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1647, PETRI_PLACES=625, PETRI_TRANSITIONS=598} [2023-11-29 01:34:36,394 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 24 predicate places. [2023-11-29 01:34:36,395 INFO L495 AbstractCegarLoop]: Abstraction has has 625 places, 598 transitions, 1647 flow [2023-11-29 01:34:36,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 606.0) internal successors, (3636), 6 states have internal predecessors, (3636), 0 states have call successors, (0), 0 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:34:36,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:36,395 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] [2023-11-29 01:34:36,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 01:34:36,395 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:36,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:36,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1750237352, now seen corresponding path program 1 times [2023-11-29 01:34:36,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:36,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655273330] [2023-11-29 01:34:36,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:36,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 01:34:36,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:36,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655273330] [2023-11-29 01:34:36,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655273330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:36,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:36,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:34:36,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285436484] [2023-11-29 01:34:36,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:36,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:34:36,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:36,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:34:36,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:37,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 652 [2023-11-29 01:34:37,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 598 transitions, 1647 flow. Second operand has 6 states, 6 states have (on average 601.1666666666666) internal successors, (3607), 6 states have internal predecessors, (3607), 0 states have call successors, (0), 0 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:34:37,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:37,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 652 [2023-11-29 01:34:37,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:38,588 INFO L124 PetriNetUnfolderBase]: 271/4515 cut-off events. [2023-11-29 01:34:38,588 INFO L125 PetriNetUnfolderBase]: For 821/833 co-relation queries the response was YES. [2023-11-29 01:34:38,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6336 conditions, 4515 events. 271/4515 cut-off events. For 821/833 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 37981 event pairs, 38 based on Foata normal form. 0/4333 useless extension candidates. Maximal degree in co-relation 6241. Up to 214 conditions per place. [2023-11-29 01:34:38,650 INFO L140 encePairwiseOnDemand]: 645/652 looper letters, 39 selfloop transitions, 5 changer transitions 0/605 dead transitions. [2023-11-29 01:34:38,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 605 transitions, 1758 flow [2023-11-29 01:34:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:34:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:34:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3631 transitions. [2023-11-29 01:34:38,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9281697341513292 [2023-11-29 01:34:38,653 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3631 transitions. [2023-11-29 01:34:38,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3631 transitions. [2023-11-29 01:34:38,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:38,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3631 transitions. [2023-11-29 01:34:38,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 605.1666666666666) internal successors, (3631), 6 states have internal predecessors, (3631), 0 states have call successors, (0), 0 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:34:38,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:38,657 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 652.0) internal successors, (4564), 7 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:34:38,657 INFO L175 Difference]: Start difference. First operand has 625 places, 598 transitions, 1647 flow. Second operand 6 states and 3631 transitions. [2023-11-29 01:34:38,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 605 transitions, 1758 flow [2023-11-29 01:34:38,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 605 transitions, 1751 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 01:34:38,670 INFO L231 Difference]: Finished difference. Result has 624 places, 596 transitions, 1646 flow [2023-11-29 01:34:38,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1636, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1646, PETRI_PLACES=624, PETRI_TRANSITIONS=596} [2023-11-29 01:34:38,671 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 23 predicate places. [2023-11-29 01:34:38,671 INFO L495 AbstractCegarLoop]: Abstraction has has 624 places, 596 transitions, 1646 flow [2023-11-29 01:34:38,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 601.1666666666666) internal successors, (3607), 6 states have internal predecessors, (3607), 0 states have call successors, (0), 0 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:34:38,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:38,672 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:34:38,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 01:34:38,672 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:38,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:38,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1453091611, now seen corresponding path program 1 times [2023-11-29 01:34:38,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:38,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69696966] [2023-11-29 01:34:38,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:38,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:38,722 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:34:38,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:38,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69696966] [2023-11-29 01:34:38,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69696966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:38,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:38,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:38,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490062041] [2023-11-29 01:34:38,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:38,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:38,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:38,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:38,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:38,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 652 [2023-11-29 01:34:38,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 596 transitions, 1646 flow. Second operand has 3 states, 3 states have (on average 624.0) internal successors, (1872), 3 states have internal predecessors, (1872), 0 states have call successors, (0), 0 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:34:38,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:38,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 652 [2023-11-29 01:34:38,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:39,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1795] thread3EXIT-->L105-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][414], [Black: 700#true, Black: 894#true, Black: 770#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 707#(not |thread2Thread1of1ForFork2_#t~short11#1|), 896#(= |#race~a3~0| 0), Black: 711#true, 661#(= |#race~n2~0| 0), 798#true, Black: 843#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 835#(<= ~n3~0 0), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 836#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 927#true, Black: 849#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 604#L105-7true, Black: 780#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 793#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 669#(= |#race~n3~0| 0), Black: 779#(<= ~n1~0 0), Black: 735#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 729#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 721#(<= ~n1~0 0), Black: 722#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 862#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 861#(<= ~n3~0 0), 646#(= |#race~n1~0| 0), 702#(= |#race~a1~0| 0), Black: 875#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 685#(not |thread1Thread1of1ForFork1_#t~short2#1|), 934#true, Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 804#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 925#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 694#(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)), Black: 803#(<= ~n2~0 0), Black: 748#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), 828#(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: 747#(<= ~n2~0 0), Black: 761#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 753#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 713#(= |#race~a2~0| 0), Black: 755#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2023-11-29 01:34:39,722 INFO L294 olderBase$Statistics]: this new event has 351 ancestors and is not cut-off event [2023-11-29 01:34:39,722 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:34:39,723 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:34:39,723 INFO L297 olderBase$Statistics]: existing Event has 382 ancestors and is not cut-off event [2023-11-29 01:34:39,785 INFO L124 PetriNetUnfolderBase]: 151/4502 cut-off events. [2023-11-29 01:34:39,785 INFO L125 PetriNetUnfolderBase]: For 574/596 co-relation queries the response was YES. [2023-11-29 01:34:39,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6039 conditions, 4502 events. 151/4502 cut-off events. For 574/596 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 34215 event pairs, 27 based on Foata normal form. 0/4358 useless extension candidates. Maximal degree in co-relation 5945. Up to 129 conditions per place. [2023-11-29 01:34:39,857 INFO L140 encePairwiseOnDemand]: 650/652 looper letters, 9 selfloop transitions, 1 changer transitions 0/595 dead transitions. [2023-11-29 01:34:39,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 595 transitions, 1664 flow [2023-11-29 01:34:39,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1874 transitions. [2023-11-29 01:34:39,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9580777096114519 [2023-11-29 01:34:39,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1874 transitions. [2023-11-29 01:34:39,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1874 transitions. [2023-11-29 01:34:39,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:39,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1874 transitions. [2023-11-29 01:34:39,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 624.6666666666666) internal successors, (1874), 3 states have internal predecessors, (1874), 0 states have call successors, (0), 0 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:34:39,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:39,863 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:39,863 INFO L175 Difference]: Start difference. First operand has 624 places, 596 transitions, 1646 flow. Second operand 3 states and 1874 transitions. [2023-11-29 01:34:39,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 595 transitions, 1664 flow [2023-11-29 01:34:39,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 595 transitions, 1654 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:34:39,878 INFO L231 Difference]: Finished difference. Result has 620 places, 595 transitions, 1636 flow [2023-11-29 01:34:39,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1636, PETRI_PLACES=620, PETRI_TRANSITIONS=595} [2023-11-29 01:34:39,879 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 19 predicate places. [2023-11-29 01:34:39,879 INFO L495 AbstractCegarLoop]: Abstraction has has 620 places, 595 transitions, 1636 flow [2023-11-29 01:34:39,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.0) internal successors, (1872), 3 states have internal predecessors, (1872), 0 states have call successors, (0), 0 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:34:39,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:39,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 01:34:39,880 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:39,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash -94178383, now seen corresponding path program 1 times [2023-11-29 01:34:39,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:39,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126018736] [2023-11-29 01:34:39,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:39,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:39,934 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:34:39,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:39,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126018736] [2023-11-29 01:34:39,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126018736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:39,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:39,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:39,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885517710] [2023-11-29 01:34:39,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:39,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:39,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:39,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:39,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:39,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 652 [2023-11-29 01:34:39,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 595 transitions, 1636 flow. Second operand has 3 states, 3 states have (on average 624.0) internal successors, (1872), 3 states have internal predecessors, (1872), 0 states have call successors, (0), 0 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:34:39,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:39,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 652 [2023-11-29 01:34:39,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:40,889 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1795] thread3EXIT-->L105-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][415], [Black: 700#true, Black: 894#true, Black: 770#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 707#(not |thread2Thread1of1ForFork2_#t~short11#1|), 896#(= |#race~a3~0| 0), Black: 711#true, 661#(= |#race~n2~0| 0), 798#true, Black: 843#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 835#(<= ~n3~0 0), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 836#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 849#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 604#L105-7true, Black: 780#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 669#(= |#race~n3~0| 0), Black: 793#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 779#(<= ~n1~0 0), Black: 735#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 729#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 721#(<= ~n1~0 0), Black: 722#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 938#true, Black: 862#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 861#(<= ~n3~0 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short2#1|), 702#(= |#race~a1~0| 0), Black: 875#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), 934#true, Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 804#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 694#(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)), Black: 803#(<= ~n2~0 0), 925#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 748#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), 828#(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: 747#(<= ~n2~0 0), Black: 761#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 753#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 713#(= |#race~a2~0| 0), Black: 755#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2023-11-29 01:34:40,889 INFO L294 olderBase$Statistics]: this new event has 351 ancestors and is not cut-off event [2023-11-29 01:34:40,889 INFO L297 olderBase$Statistics]: existing Event has 382 ancestors and is not cut-off event [2023-11-29 01:34:40,889 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:34:40,889 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is not cut-off event [2023-11-29 01:34:40,923 INFO L124 PetriNetUnfolderBase]: 133/4040 cut-off events. [2023-11-29 01:34:40,923 INFO L125 PetriNetUnfolderBase]: For 479/501 co-relation queries the response was YES. [2023-11-29 01:34:40,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5319 conditions, 4040 events. 133/4040 cut-off events. For 479/501 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 30405 event pairs, 30 based on Foata normal form. 0/3922 useless extension candidates. Maximal degree in co-relation 5225. Up to 124 conditions per place. [2023-11-29 01:34:40,996 INFO L140 encePairwiseOnDemand]: 650/652 looper letters, 9 selfloop transitions, 1 changer transitions 0/594 dead transitions. [2023-11-29 01:34:40,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 594 transitions, 1654 flow [2023-11-29 01:34:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1874 transitions. [2023-11-29 01:34:40,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9580777096114519 [2023-11-29 01:34:40,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1874 transitions. [2023-11-29 01:34:40,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1874 transitions. [2023-11-29 01:34:40,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:40,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1874 transitions. [2023-11-29 01:34:41,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 624.6666666666666) internal successors, (1874), 3 states have internal predecessors, (1874), 0 states have call successors, (0), 0 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:34:41,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:41,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:41,002 INFO L175 Difference]: Start difference. First operand has 620 places, 595 transitions, 1636 flow. Second operand 3 states and 1874 transitions. [2023-11-29 01:34:41,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 594 transitions, 1654 flow [2023-11-29 01:34:41,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 594 transitions, 1653 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:34:41,013 INFO L231 Difference]: Finished difference. Result has 620 places, 594 transitions, 1635 flow [2023-11-29 01:34:41,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1635, PETRI_PLACES=620, PETRI_TRANSITIONS=594} [2023-11-29 01:34:41,014 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 19 predicate places. [2023-11-29 01:34:41,014 INFO L495 AbstractCegarLoop]: Abstraction has has 620 places, 594 transitions, 1635 flow [2023-11-29 01:34:41,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.0) internal successors, (1872), 3 states have internal predecessors, (1872), 0 states have call successors, (0), 0 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:34:41,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:41,015 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] [2023-11-29 01:34:41,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 01:34:41,015 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:41,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:41,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2145447906, now seen corresponding path program 1 times [2023-11-29 01:34:41,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:41,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147154690] [2023-11-29 01:34:41,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:41,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:41,078 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:34:41,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:41,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147154690] [2023-11-29 01:34:41,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147154690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:41,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:41,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:41,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878531147] [2023-11-29 01:34:41,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:41,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:41,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:41,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:41,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:41,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 652 [2023-11-29 01:34:41,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 594 transitions, 1635 flow. Second operand has 3 states, 3 states have (on average 624.0) internal successors, (1872), 3 states have internal predecessors, (1872), 0 states have call successors, (0), 0 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:34:41,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:41,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 652 [2023-11-29 01:34:41,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:42,032 INFO L124 PetriNetUnfolderBase]: 158/4152 cut-off events. [2023-11-29 01:34:42,032 INFO L125 PetriNetUnfolderBase]: For 548/560 co-relation queries the response was YES. [2023-11-29 01:34:42,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5597 conditions, 4152 events. 158/4152 cut-off events. For 548/560 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 32303 event pairs, 38 based on Foata normal form. 30/4070 useless extension candidates. Maximal degree in co-relation 5503. Up to 149 conditions per place. [2023-11-29 01:34:42,094 INFO L140 encePairwiseOnDemand]: 650/652 looper letters, 7 selfloop transitions, 0 changer transitions 19/593 dead transitions. [2023-11-29 01:34:42,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 593 transitions, 1651 flow [2023-11-29 01:34:42,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:42,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1873 transitions. [2023-11-29 01:34:42,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9575664621676891 [2023-11-29 01:34:42,097 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1873 transitions. [2023-11-29 01:34:42,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1873 transitions. [2023-11-29 01:34:42,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:42,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1873 transitions. [2023-11-29 01:34:42,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:34:42,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:42,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:42,101 INFO L175 Difference]: Start difference. First operand has 620 places, 594 transitions, 1635 flow. Second operand 3 states and 1873 transitions. [2023-11-29 01:34:42,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 593 transitions, 1651 flow [2023-11-29 01:34:42,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 593 transitions, 1650 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:34:42,118 INFO L231 Difference]: Finished difference. Result has 620 places, 574 transitions, 1537 flow [2023-11-29 01:34:42,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1537, PETRI_PLACES=620, PETRI_TRANSITIONS=574} [2023-11-29 01:34:42,119 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 19 predicate places. [2023-11-29 01:34:42,120 INFO L495 AbstractCegarLoop]: Abstraction has has 620 places, 574 transitions, 1537 flow [2023-11-29 01:34:42,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.0) internal successors, (1872), 3 states have internal predecessors, (1872), 0 states have call successors, (0), 0 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:34:42,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:42,120 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] [2023-11-29 01:34:42,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 01:34:42,120 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:42,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:42,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1758747876, now seen corresponding path program 1 times [2023-11-29 01:34:42,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:42,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984506179] [2023-11-29 01:34:42,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:42,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 01:34:42,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984506179] [2023-11-29 01:34:42,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984506179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:42,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:42,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:42,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757940442] [2023-11-29 01:34:42,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:42,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:42,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:42,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:42,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:42,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 619 out of 652 [2023-11-29 01:34:42,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 574 transitions, 1537 flow. Second operand has 3 states, 3 states have (on average 620.6666666666666) internal successors, (1862), 3 states have internal predecessors, (1862), 0 states have call successors, (0), 0 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:34:42,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:42,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 619 of 652 [2023-11-29 01:34:42,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:43,164 INFO L124 PetriNetUnfolderBase]: 155/3969 cut-off events. [2023-11-29 01:34:43,165 INFO L125 PetriNetUnfolderBase]: For 374/384 co-relation queries the response was YES. [2023-11-29 01:34:43,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5244 conditions, 3969 events. 155/3969 cut-off events. For 374/384 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 27602 event pairs, 25 based on Foata normal form. 0/3870 useless extension candidates. Maximal degree in co-relation 5210. Up to 107 conditions per place. [2023-11-29 01:34:43,218 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 10 selfloop transitions, 2 changer transitions 12/575 dead transitions. [2023-11-29 01:34:43,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 575 transitions, 1565 flow [2023-11-29 01:34:43,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:43,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2023-11-29 01:34:43,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9560327198364008 [2023-11-29 01:34:43,220 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1870 transitions. [2023-11-29 01:34:43,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1870 transitions. [2023-11-29 01:34:43,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:43,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1870 transitions. [2023-11-29 01:34:43,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:34:43,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:43,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:43,224 INFO L175 Difference]: Start difference. First operand has 620 places, 574 transitions, 1537 flow. Second operand 3 states and 1870 transitions. [2023-11-29 01:34:43,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 575 transitions, 1565 flow [2023-11-29 01:34:43,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 575 transitions, 1555 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-11-29 01:34:43,239 INFO L231 Difference]: Finished difference. Result has 606 places, 561 transitions, 1447 flow [2023-11-29 01:34:43,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1447, PETRI_PLACES=606, PETRI_TRANSITIONS=561} [2023-11-29 01:34:43,241 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, 5 predicate places. [2023-11-29 01:34:43,241 INFO L495 AbstractCegarLoop]: Abstraction has has 606 places, 561 transitions, 1447 flow [2023-11-29 01:34:43,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.6666666666666) internal successors, (1862), 3 states have internal predecessors, (1862), 0 states have call successors, (0), 0 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:34:43,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:43,242 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:34:43,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 01:34:43,242 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:43,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1466818612, now seen corresponding path program 1 times [2023-11-29 01:34:43,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:43,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196051876] [2023-11-29 01:34:43,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:43,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 01:34:43,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:43,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196051876] [2023-11-29 01:34:43,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196051876] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:43,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:43,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:43,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103809750] [2023-11-29 01:34:43,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:43,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:43,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:43,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:43,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:43,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 619 out of 652 [2023-11-29 01:34:43,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 561 transitions, 1447 flow. Second operand has 3 states, 3 states have (on average 621.0) internal successors, (1863), 3 states have internal predecessors, (1863), 0 states have call successors, (0), 0 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:34:43,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:43,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 619 of 652 [2023-11-29 01:34:43,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:44,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1483] L51-8-->L51-9: Formula: (= |v_#race~a2~0_1| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_1|} AuxVars[] AssignedVars[#race~a2~0][363], [Black: 700#true, Black: 894#true, Black: 770#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 707#(not |thread2Thread1of1ForFork2_#t~short11#1|), 896#(= |#race~a3~0| 0), Black: 711#true, 661#(= |#race~n2~0| 0), 798#true, Black: 843#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 835#(<= ~n3~0 0), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 836#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 849#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 48#L102-4true, Black: 780#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 669#(= |#race~n3~0| 0), Black: 793#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 779#(<= ~n1~0 0), 607#L65-1true, Black: 735#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 729#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 721#(<= ~n1~0 0), Black: 722#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 316#L51-9true, 946#true, Black: 862#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 861#(<= ~n3~0 0), 646#(= |#race~n1~0| 0), Black: 875#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 685#(not |thread1Thread1of1ForFork1_#t~short2#1|), 702#(= |#race~a1~0| 0), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 804#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 179#L79-1true, Black: 803#(<= ~n2~0 0), 950#true, Black: 748#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), 942#true, Black: 747#(<= ~n2~0 0), Black: 761#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 753#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 755#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 713#(= |#race~a2~0| 0)]) [2023-11-29 01:34:44,142 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2023-11-29 01:34:44,142 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2023-11-29 01:34:44,142 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2023-11-29 01:34:44,142 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2023-11-29 01:34:44,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1794] thread2EXIT-->L104-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem47#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_6|} AuxVars[] AssignedVars[][422], [Black: 700#true, Black: 894#true, Black: 770#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 707#(not |thread2Thread1of1ForFork2_#t~short11#1|), 896#(= |#race~a3~0| 0), Black: 711#true, 661#(= |#race~n2~0| 0), 798#true, Black: 843#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 835#(<= ~n3~0 0), Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 836#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 849#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 780#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 793#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 669#(= |#race~n3~0| 0), Black: 779#(<= ~n1~0 0), Black: 735#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 729#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 721#(<= ~n1~0 0), Black: 722#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 946#true, Black: 862#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 646#(= |#race~n1~0| 0), Black: 861#(<= ~n3~0 0), Black: 875#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 685#(not |thread1Thread1of1ForFork1_#t~short2#1|), 702#(= |#race~a1~0| 0), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 179#L79-1true, Black: 804#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 803#(<= ~n2~0 0), 694#(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)), 576#L104-7true, 950#true, 828#(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|)))), 942#true, Black: 748#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 753#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 755#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 713#(= |#race~a2~0| 0)]) [2023-11-29 01:34:44,239 INFO L294 olderBase$Statistics]: this new event has 382 ancestors and is cut-off event [2023-11-29 01:34:44,239 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2023-11-29 01:34:44,239 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2023-11-29 01:34:44,239 INFO L297 olderBase$Statistics]: existing Event has 376 ancestors and is cut-off event [2023-11-29 01:34:44,245 INFO L124 PetriNetUnfolderBase]: 139/3195 cut-off events. [2023-11-29 01:34:44,245 INFO L125 PetriNetUnfolderBase]: For 255/269 co-relation queries the response was YES. [2023-11-29 01:34:44,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4136 conditions, 3195 events. 139/3195 cut-off events. For 255/269 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 21511 event pairs, 27 based on Foata normal form. 0/3103 useless extension candidates. Maximal degree in co-relation 4101. Up to 90 conditions per place. [2023-11-29 01:34:44,314 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 10 selfloop transitions, 2 changer transitions 10/562 dead transitions. [2023-11-29 01:34:44,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 562 transitions, 1475 flow [2023-11-29 01:34:44,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2023-11-29 01:34:44,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9560327198364008 [2023-11-29 01:34:44,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1870 transitions. [2023-11-29 01:34:44,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1870 transitions. [2023-11-29 01:34:44,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:44,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1870 transitions. [2023-11-29 01:34:44,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:34:44,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:44,322 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:44,322 INFO L175 Difference]: Start difference. First operand has 606 places, 561 transitions, 1447 flow. Second operand 3 states and 1870 transitions. [2023-11-29 01:34:44,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 562 transitions, 1475 flow [2023-11-29 01:34:44,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 562 transitions, 1429 flow, removed 13 selfloop flow, removed 13 redundant places. [2023-11-29 01:34:44,337 INFO L231 Difference]: Finished difference. Result has 587 places, 550 transitions, 1336 flow [2023-11-29 01:34:44,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1336, PETRI_PLACES=587, PETRI_TRANSITIONS=550} [2023-11-29 01:34:44,339 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -14 predicate places. [2023-11-29 01:34:44,339 INFO L495 AbstractCegarLoop]: Abstraction has has 587 places, 550 transitions, 1336 flow [2023-11-29 01:34:44,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 621.0) internal successors, (1863), 3 states have internal predecessors, (1863), 0 states have call successors, (0), 0 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:34:44,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:34:44,340 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:34:44,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-29 01:34:44,340 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-29 01:34:44,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2137584897, now seen corresponding path program 1 times [2023-11-29 01:34:44,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:44,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615641010] [2023-11-29 01:34:44,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:44,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 01:34:44,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:44,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615641010] [2023-11-29 01:34:44,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615641010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:44,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:44,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:44,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31037167] [2023-11-29 01:34:44,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:44,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:44,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:44,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:44,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:44,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 619 out of 652 [2023-11-29 01:34:44,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 550 transitions, 1336 flow. Second operand has 3 states, 3 states have (on average 621.3333333333334) internal successors, (1864), 3 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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:34:44,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:34:44,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 619 of 652 [2023-11-29 01:34:44,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:34:44,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1483] L51-8-->L51-9: Formula: (= |v_#race~a2~0_1| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_1|} AuxVars[] AssignedVars[#race~a2~0][336], [Black: 700#true, Black: 894#true, Black: 770#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 707#(not |thread2Thread1of1ForFork2_#t~short11#1|), 896#(= |#race~a3~0| 0), Black: 711#true, 661#(= |#race~n2~0| 0), 798#true, Black: 841#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 780#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 48#L102-4true, 669#(= |#race~n3~0| 0), Black: 793#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 779#(<= ~n1~0 0), 607#L65-1true, Black: 735#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 729#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 721#(<= ~n1~0 0), Black: 722#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 316#L51-9true, 646#(= |#race~n1~0| 0), 702#(= |#race~a1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 179#L79-1true, Black: 804#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 954#true, Black: 803#(<= ~n2~0 0), 950#true, 942#true, Black: 748#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 753#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 755#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 713#(= |#race~a2~0| 0)]) [2023-11-29 01:34:44,964 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2023-11-29 01:34:44,964 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2023-11-29 01:34:44,964 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2023-11-29 01:34:44,964 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2023-11-29 01:34:45,015 INFO L124 PetriNetUnfolderBase]: 123/2072 cut-off events. [2023-11-29 01:34:45,016 INFO L125 PetriNetUnfolderBase]: For 142/155 co-relation queries the response was YES. [2023-11-29 01:34:45,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2647 conditions, 2072 events. 123/2072 cut-off events. For 142/155 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 12984 event pairs, 24 based on Foata normal form. 0/1991 useless extension candidates. Maximal degree in co-relation 2619. Up to 83 conditions per place. [2023-11-29 01:34:45,052 INFO L140 encePairwiseOnDemand]: 649/652 looper letters, 0 selfloop transitions, 0 changer transitions 551/551 dead transitions. [2023-11-29 01:34:45,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 551 transitions, 1364 flow [2023-11-29 01:34:45,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:34:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2023-11-29 01:34:45,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9560327198364008 [2023-11-29 01:34:45,054 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1870 transitions. [2023-11-29 01:34:45,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1870 transitions. [2023-11-29 01:34:45,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:34:45,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1870 transitions. [2023-11-29 01:34:45,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:34:45,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:45,057 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 652.0) internal successors, (2608), 4 states have internal predecessors, (2608), 0 states have call successors, (0), 0 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:34:45,057 INFO L175 Difference]: Start difference. First operand has 587 places, 550 transitions, 1336 flow. Second operand 3 states and 1870 transitions. [2023-11-29 01:34:45,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 551 transitions, 1364 flow [2023-11-29 01:34:45,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 551 transitions, 1324 flow, removed 10 selfloop flow, removed 13 redundant places. [2023-11-29 01:34:45,064 INFO L231 Difference]: Finished difference. Result has 568 places, 0 transitions, 0 flow [2023-11-29 01:34:45,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=652, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=568, PETRI_TRANSITIONS=0} [2023-11-29 01:34:45,065 INFO L281 CegarLoopForPetriNet]: 601 programPoint places, -33 predicate places. [2023-11-29 01:34:45,065 INFO L495 AbstractCegarLoop]: Abstraction has has 568 places, 0 transitions, 0 flow [2023-11-29 01:34:45,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 621.3333333333334) internal successors, (1864), 3 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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:34:45,067 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (104 of 105 remaining) [2023-11-29 01:34:45,068 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (103 of 105 remaining) [2023-11-29 01:34:45,068 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (102 of 105 remaining) [2023-11-29 01:34:45,068 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (101 of 105 remaining) [2023-11-29 01:34:45,068 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (100 of 105 remaining) [2023-11-29 01:34:45,068 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (99 of 105 remaining) [2023-11-29 01:34:45,068 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (98 of 105 remaining) [2023-11-29 01:34:45,068 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (97 of 105 remaining) [2023-11-29 01:34:45,068 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (96 of 105 remaining) [2023-11-29 01:34:45,068 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (95 of 105 remaining) [2023-11-29 01:34:45,068 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (94 of 105 remaining) [2023-11-29 01:34:45,068 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (93 of 105 remaining) [2023-11-29 01:34:45,068 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (92 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (91 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (90 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (89 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (88 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (87 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (86 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (85 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (84 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (83 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (82 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (81 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (80 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (79 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (78 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (77 of 105 remaining) [2023-11-29 01:34:45,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (76 of 105 remaining) [2023-11-29 01:34:45,070 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (75 of 105 remaining) [2023-11-29 01:34:45,070 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (74 of 105 remaining) [2023-11-29 01:34:45,070 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (73 of 105 remaining) [2023-11-29 01:34:45,070 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (72 of 105 remaining) [2023-11-29 01:34:45,070 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (71 of 105 remaining) [2023-11-29 01:34:45,070 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (70 of 105 remaining) [2023-11-29 01:34:45,070 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (69 of 105 remaining) [2023-11-29 01:34:45,070 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (68 of 105 remaining) [2023-11-29 01:34:45,070 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (67 of 105 remaining) [2023-11-29 01:34:45,070 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (66 of 105 remaining) [2023-11-29 01:34:45,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (65 of 105 remaining) [2023-11-29 01:34:45,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (64 of 105 remaining) [2023-11-29 01:34:45,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (63 of 105 remaining) [2023-11-29 01:34:45,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (62 of 105 remaining) [2023-11-29 01:34:45,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (61 of 105 remaining) [2023-11-29 01:34:45,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (60 of 105 remaining) [2023-11-29 01:34:45,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (59 of 105 remaining) [2023-11-29 01:34:45,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (58 of 105 remaining) [2023-11-29 01:34:45,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (57 of 105 remaining) [2023-11-29 01:34:45,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (56 of 105 remaining) [2023-11-29 01:34:45,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (55 of 105 remaining) [2023-11-29 01:34:45,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (54 of 105 remaining) [2023-11-29 01:34:45,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (53 of 105 remaining) [2023-11-29 01:34:45,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (52 of 105 remaining) [2023-11-29 01:34:45,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (51 of 105 remaining) [2023-11-29 01:34:45,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (50 of 105 remaining) [2023-11-29 01:34:45,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (49 of 105 remaining) [2023-11-29 01:34:45,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (48 of 105 remaining) [2023-11-29 01:34:45,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (47 of 105 remaining) [2023-11-29 01:34:45,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (46 of 105 remaining) [2023-11-29 01:34:45,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (45 of 105 remaining) [2023-11-29 01:34:45,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 105 remaining) [2023-11-29 01:34:45,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 105 remaining) [2023-11-29 01:34:45,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 105 remaining) [2023-11-29 01:34:45,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 105 remaining) [2023-11-29 01:34:45,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (40 of 105 remaining) [2023-11-29 01:34:45,074 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (39 of 105 remaining) [2023-11-29 01:34:45,074 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 105 remaining) [2023-11-29 01:34:45,074 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (37 of 105 remaining) [2023-11-29 01:34:45,074 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (36 of 105 remaining) [2023-11-29 01:34:45,074 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (35 of 105 remaining) [2023-11-29 01:34:45,074 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 105 remaining) [2023-11-29 01:34:45,074 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (33 of 105 remaining) [2023-11-29 01:34:45,074 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (32 of 105 remaining) [2023-11-29 01:34:45,075 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (31 of 105 remaining) [2023-11-29 01:34:45,075 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (30 of 105 remaining) [2023-11-29 01:34:45,075 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (29 of 105 remaining) [2023-11-29 01:34:45,075 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (28 of 105 remaining) [2023-11-29 01:34:45,075 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 105 remaining) [2023-11-29 01:34:45,075 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (26 of 105 remaining) [2023-11-29 01:34:45,075 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (25 of 105 remaining) [2023-11-29 01:34:45,075 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (24 of 105 remaining) [2023-11-29 01:34:45,076 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (23 of 105 remaining) [2023-11-29 01:34:45,076 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (22 of 105 remaining) [2023-11-29 01:34:45,076 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (21 of 105 remaining) [2023-11-29 01:34:45,076 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (20 of 105 remaining) [2023-11-29 01:34:45,076 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 105 remaining) [2023-11-29 01:34:45,076 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (18 of 105 remaining) [2023-11-29 01:34:45,076 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (17 of 105 remaining) [2023-11-29 01:34:45,076 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (16 of 105 remaining) [2023-11-29 01:34:45,077 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (15 of 105 remaining) [2023-11-29 01:34:45,077 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (14 of 105 remaining) [2023-11-29 01:34:45,077 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 105 remaining) [2023-11-29 01:34:45,077 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 105 remaining) [2023-11-29 01:34:45,077 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 105 remaining) [2023-11-29 01:34:45,077 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 105 remaining) [2023-11-29 01:34:45,077 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 105 remaining) [2023-11-29 01:34:45,077 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (8 of 105 remaining) [2023-11-29 01:34:45,078 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (7 of 105 remaining) [2023-11-29 01:34:45,078 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 105 remaining) [2023-11-29 01:34:45,078 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 105 remaining) [2023-11-29 01:34:45,078 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (4 of 105 remaining) [2023-11-29 01:34:45,078 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (3 of 105 remaining) [2023-11-29 01:34:45,078 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (2 of 105 remaining) [2023-11-29 01:34:45,078 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (1 of 105 remaining) [2023-11-29 01:34:45,078 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (0 of 105 remaining) [2023-11-29 01:34:45,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-29 01:34:45,079 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] [2023-11-29 01:34:45,085 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 01:34:45,085 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:34:45,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:34:45 BasicIcfg [2023-11-29 01:34:45,091 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:34:45,092 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:34:45,092 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:34:45,092 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:34:45,093 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:33:02" (3/4) ... [2023-11-29 01:34:45,094 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 01:34:45,098 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-29 01:34:45,098 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-29 01:34:45,098 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-11-29 01:34:45,107 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2023-11-29 01:34:45,108 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-29 01:34:45,108 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 01:34:45,109 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 01:34:45,206 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed871f78-5579-4781-a167-bb3dd216668c/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 01:34:45,207 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed871f78-5579-4781-a167-bb3dd216668c/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 01:34:45,207 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:34:45,208 INFO L158 Benchmark]: Toolchain (without parser) took 104484.11ms. Allocated memory was 188.7MB in the beginning and 12.1GB in the end (delta: 11.9GB). Free memory was 147.0MB in the beginning and 7.4GB in the end (delta: -7.2GB). Peak memory consumption was 4.7GB. Max. memory is 16.1GB. [2023-11-29 01:34:45,209 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 188.7MB. Free memory is still 158.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:34:45,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.43ms. Allocated memory is still 188.7MB. Free memory was 146.7MB in the beginning and 132.8MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 01:34:45,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.61ms. Allocated memory is still 188.7MB. Free memory was 132.8MB in the beginning and 128.1MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:34:45,210 INFO L158 Benchmark]: Boogie Preprocessor took 64.33ms. Allocated memory is still 188.7MB. Free memory was 128.1MB in the beginning and 123.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:34:45,210 INFO L158 Benchmark]: RCFGBuilder took 1025.25ms. Allocated memory is still 188.7MB. Free memory was 123.9MB in the beginning and 151.4MB in the end (delta: -27.4MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2023-11-29 01:34:45,210 INFO L158 Benchmark]: TraceAbstraction took 102904.84ms. Allocated memory was 188.7MB in the beginning and 12.1GB in the end (delta: 11.9GB). Free memory was 150.7MB in the beginning and 7.4GB in the end (delta: -7.2GB). Peak memory consumption was 4.7GB. Max. memory is 16.1GB. [2023-11-29 01:34:45,211 INFO L158 Benchmark]: Witness Printer took 115.71ms. Allocated memory is still 12.1GB. Free memory was 7.4GB in the beginning and 7.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 01:34:45,212 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.17ms. Allocated memory is still 188.7MB. Free memory is still 158.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.43ms. Allocated memory is still 188.7MB. Free memory was 146.7MB in the beginning and 132.8MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.61ms. Allocated memory is still 188.7MB. Free memory was 132.8MB in the beginning and 128.1MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.33ms. Allocated memory is still 188.7MB. Free memory was 128.1MB in the beginning and 123.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1025.25ms. Allocated memory is still 188.7MB. Free memory was 123.9MB in the beginning and 151.4MB in the end (delta: -27.4MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. * TraceAbstraction took 102904.84ms. Allocated memory was 188.7MB in the beginning and 12.1GB in the end (delta: 11.9GB). Free memory was 150.7MB in the beginning and 7.4GB in the end (delta: -7.2GB). Peak memory consumption was 4.7GB. Max. memory is 16.1GB. * Witness Printer took 115.71ms. Allocated memory is still 12.1GB. Free memory was 7.4GB in the beginning and 7.4GB 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: 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: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 77]: 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: 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: 79]: 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: 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: 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: 80]: 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: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: 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: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 953 locations, 105 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 102.7s, OverallIterations: 40, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 94.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8166 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4933 mSDsluCounter, 6713 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6191 mSDsCounter, 2261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13736 IncrementalHoareTripleChecker+Invalid, 15997 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2261 mSolverCounterUnsat, 522 mSDtfsCounter, 13736 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1676occurred in iteration=26, InterpolantAutomatonStates: 199, 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, 6.4s InterpolantComputationTime, 6943 NumberOfCodeBlocks, 6943 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 6903 ConstructedInterpolants, 0 QuantifiedInterpolants, 9474 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 23/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 60 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 01:34:45,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed871f78-5579-4781-a167-bb3dd216668c/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