./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/bin/uautomizer-verify-zZY32mL2XJ --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 df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:31:20,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:31:20,244 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-23 22:31:20,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:31:20,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:31:20,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:31:20,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:31:20,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:31:20,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:31:20,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:31:20,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:31:20,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:31:20,295 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:31:20,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:31:20,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:31:20,298 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:31:20,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:31:20,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:31:20,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:31:20,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:31:20,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:31:20,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:31:20,301 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-23 22:31:20,301 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 22:31:20,302 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:31:20,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:31:20,302 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:31:20,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:31:20,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:31:20,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:31:20,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:31:20,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:31:20,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:31:20,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:31:20,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:31:20,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:31:20,306 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:31:20,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:31:20,306 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:31:20,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:31:20,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:31:20,307 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_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/bin/uautomizer-verify-zZY32mL2XJ/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_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/bin/uautomizer-verify-zZY32mL2XJ 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 -> df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 [2023-11-23 22:31:20,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:31:20,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:31:20,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:31:20,607 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:31:20,608 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:31:20,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2023-11-23 22:31:23,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:31:23,907 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:31:23,908 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2023-11-23 22:31:23,917 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/bin/uautomizer-verify-zZY32mL2XJ/data/622de22dc/52cef1d21c9d47b98d79e05e835b3227/FLAGd8849546e [2023-11-23 22:31:23,933 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/bin/uautomizer-verify-zZY32mL2XJ/data/622de22dc/52cef1d21c9d47b98d79e05e835b3227 [2023-11-23 22:31:23,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:31:23,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:31:23,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:31:23,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:31:23,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:31:23,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:23" (1/1) ... [2023-11-23 22:31:23,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbcc034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:23, skipping insertion in model container [2023-11-23 22:31:23,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:23" (1/1) ... [2023-11-23 22:31:23,982 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:31:24,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:31:24,217 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:31:24,261 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:31:24,279 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:31:24,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:24 WrapperNode [2023-11-23 22:31:24,279 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:31:24,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:31:24,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:31:24,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:31:24,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:24" (1/1) ... [2023-11-23 22:31:24,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:24" (1/1) ... [2023-11-23 22:31:24,360 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 279 [2023-11-23 22:31:24,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:31:24,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:31:24,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:31:24,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:31:24,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:24" (1/1) ... [2023-11-23 22:31:24,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:24" (1/1) ... [2023-11-23 22:31:24,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:24" (1/1) ... [2023-11-23 22:31:24,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:24" (1/1) ... [2023-11-23 22:31:24,395 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:24" (1/1) ... [2023-11-23 22:31:24,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:24" (1/1) ... [2023-11-23 22:31:24,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:24" (1/1) ... [2023-11-23 22:31:24,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:24" (1/1) ... [2023-11-23 22:31:24,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:31:24,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:31:24,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:31:24,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:31:24,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:24" (1/1) ... [2023-11-23 22:31:24,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:31:24,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:31:24,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:31:24,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb0a2b-7bb8-4b74-968a-5b3b3d241d54/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:31:24,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:31:24,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 22:31:24,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 22:31:24,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 22:31:24,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-23 22:31:24,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-23 22:31:24,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-23 22:31:24,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-23 22:31:24,511 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-23 22:31:24,511 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-23 22:31:24,511 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-23 22:31:24,511 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-23 22:31:24,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 22:31:24,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-11-23 22:31:24,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-11-23 22:31:24,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-11-23 22:31:24,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-11-23 22:31:24,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:31:24,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:31:24,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 22:31:24,514 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 22:31:24,678 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:31:24,680 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:31:25,447 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:31:25,472 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:31:25,473 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-23 22:31:25,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:25 BoogieIcfgContainer [2023-11-23 22:31:25,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:31:25,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:31:25,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:31:25,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:31:25,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:31:23" (1/3) ... [2023-11-23 22:31:25,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5d1858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:25, skipping insertion in model container [2023-11-23 22:31:25,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:24" (2/3) ... [2023-11-23 22:31:25,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5d1858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:25, skipping insertion in model container [2023-11-23 22:31:25,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:25" (3/3) ... [2023-11-23 22:31:25,485 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2023-11-23 22:31:25,494 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 22:31:25,506 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:31:25,506 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2023-11-23 22:31:25,507 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 22:31:25,653 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-11-23 22:31:25,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 470 places, 475 transitions, 992 flow [2023-11-23 22:31:25,905 INFO L124 PetriNetUnfolderBase]: 24/469 cut-off events. [2023-11-23 22:31:25,906 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-23 22:31:25,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 469 events. 24/469 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 851 event pairs, 0 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 293. Up to 2 conditions per place. [2023-11-23 22:31:25,917 INFO L82 GeneralOperation]: Start removeDead. Operand has 470 places, 475 transitions, 992 flow [2023-11-23 22:31:25,930 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 427 places, 430 transitions, 896 flow [2023-11-23 22:31:25,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:31:25,947 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;@53269690, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:31:25,947 INFO L358 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2023-11-23 22:31:25,953 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 22:31:25,954 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2023-11-23 22:31:25,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 22:31:25,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:25,955 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-23 22:31:25,955 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:25,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:25,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1650698020, now seen corresponding path program 1 times [2023-11-23 22:31:25,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:25,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818303268] [2023-11-23 22:31:25,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:25,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:26,234 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-23 22:31:26,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:26,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818303268] [2023-11-23 22:31:26,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818303268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:26,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:26,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:26,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988732457] [2023-11-23 22:31:26,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:26,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:26,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:26,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:26,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:26,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-23 22:31:26,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 430 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:26,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:26,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-23 22:31:26,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:26,675 INFO L124 PetriNetUnfolderBase]: 40/557 cut-off events. [2023-11-23 22:31:26,676 INFO L125 PetriNetUnfolderBase]: For 44/46 co-relation queries the response was YES. [2023-11-23 22:31:26,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 557 events. 40/557 cut-off events. For 44/46 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1859 event pairs, 20 based on Foata normal form. 91/532 useless extension candidates. Maximal degree in co-relation 460. Up to 68 conditions per place. [2023-11-23 22:31:26,693 INFO L140 encePairwiseOnDemand]: 465/475 looper letters, 22 selfloop transitions, 2 changer transitions 1/422 dead transitions. [2023-11-23 22:31:26,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 422 transitions, 928 flow [2023-11-23 22:31:26,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:26,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-23 22:31:26,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-23 22:31:26,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-23 22:31:26,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-23 22:31:26,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:26,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-23 22:31:26,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:26,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:26,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:26,756 INFO L175 Difference]: Start difference. First operand has 427 places, 430 transitions, 896 flow. Second operand 3 states and 1352 transitions. [2023-11-23 22:31:26,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 422 transitions, 928 flow [2023-11-23 22:31:26,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 422 transitions, 904 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-11-23 22:31:26,783 INFO L231 Difference]: Finished difference. Result has 416 places, 421 transitions, 858 flow [2023-11-23 22:31:26,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=416, PETRI_TRANSITIONS=421} [2023-11-23 22:31:26,790 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -11 predicate places. [2023-11-23 22:31:26,791 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 421 transitions, 858 flow [2023-11-23 22:31:26,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:26,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:26,793 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] [2023-11-23 22:31:26,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:31:26,795 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:26,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:26,796 INFO L85 PathProgramCache]: Analyzing trace with hash 752302226, now seen corresponding path program 1 times [2023-11-23 22:31:26,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:26,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887033841] [2023-11-23 22:31:26,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:26,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:26,897 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-23 22:31:26,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:26,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887033841] [2023-11-23 22:31:26,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887033841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:26,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:26,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:26,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357852508] [2023-11-23 22:31:26,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:26,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:26,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:26,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:26,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:26,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-23 22:31:26,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 421 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:26,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:26,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-23 22:31:26,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:27,141 INFO L124 PetriNetUnfolderBase]: 40/555 cut-off events. [2023-11-23 22:31:27,142 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-23 22:31:27,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 555 events. 40/555 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1815 event pairs, 20 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 617. Up to 68 conditions per place. [2023-11-23 22:31:27,156 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 22 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2023-11-23 22:31:27,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 420 transitions, 904 flow [2023-11-23 22:31:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-23 22:31:27,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-23 22:31:27,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-23 22:31:27,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-23 22:31:27,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:27,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-23 22:31:27,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:27,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:27,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:27,176 INFO L175 Difference]: Start difference. First operand has 416 places, 421 transitions, 858 flow. Second operand 3 states and 1345 transitions. [2023-11-23 22:31:27,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 420 transitions, 904 flow [2023-11-23 22:31:27,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 420 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:31:27,188 INFO L231 Difference]: Finished difference. Result has 414 places, 420 transitions, 856 flow [2023-11-23 22:31:27,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=414, PETRI_TRANSITIONS=420} [2023-11-23 22:31:27,193 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -13 predicate places. [2023-11-23 22:31:27,193 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 420 transitions, 856 flow [2023-11-23 22:31:27,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:27,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:27,195 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] [2023-11-23 22:31:27,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:31:27,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:27,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:27,202 INFO L85 PathProgramCache]: Analyzing trace with hash -453054482, now seen corresponding path program 1 times [2023-11-23 22:31:27,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:27,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423676972] [2023-11-23 22:31:27,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:27,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:27,292 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-23 22:31:27,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:27,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423676972] [2023-11-23 22:31:27,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423676972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:27,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:27,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:27,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217186115] [2023-11-23 22:31:27,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:27,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:27,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:27,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:27,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:27,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-23 22:31:27,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 420 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:27,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:27,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-23 22:31:27,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:27,521 INFO L124 PetriNetUnfolderBase]: 40/554 cut-off events. [2023-11-23 22:31:27,521 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-23 22:31:27,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 554 events. 40/554 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1752 event pairs, 20 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 605. Up to 68 conditions per place. [2023-11-23 22:31:27,535 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 22 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2023-11-23 22:31:27,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 419 transitions, 902 flow [2023-11-23 22:31:27,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-23 22:31:27,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-23 22:31:27,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-23 22:31:27,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-23 22:31:27,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:27,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-23 22:31:27,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:27,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:27,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:27,556 INFO L175 Difference]: Start difference. First operand has 414 places, 420 transitions, 856 flow. Second operand 3 states and 1345 transitions. [2023-11-23 22:31:27,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 419 transitions, 902 flow [2023-11-23 22:31:27,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 419 transitions, 898 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:31:27,570 INFO L231 Difference]: Finished difference. Result has 413 places, 419 transitions, 854 flow [2023-11-23 22:31:27,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=413, PETRI_TRANSITIONS=419} [2023-11-23 22:31:27,573 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -14 predicate places. [2023-11-23 22:31:27,573 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 419 transitions, 854 flow [2023-11-23 22:31:27,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:27,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:27,575 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] [2023-11-23 22:31:27,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:31:27,576 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:27,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:27,577 INFO L85 PathProgramCache]: Analyzing trace with hash -222115273, now seen corresponding path program 1 times [2023-11-23 22:31:27,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:27,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627009546] [2023-11-23 22:31:27,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:27,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:27,695 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-23 22:31:27,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:27,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627009546] [2023-11-23 22:31:27,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627009546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:27,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:27,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:27,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660639602] [2023-11-23 22:31:27,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:27,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:27,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:27,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:27,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:27,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-23 22:31:27,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 419 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:27,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:27,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-23 22:31:27,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:27,908 INFO L124 PetriNetUnfolderBase]: 40/553 cut-off events. [2023-11-23 22:31:27,909 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-23 22:31:27,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 553 events. 40/553 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1696 event pairs, 20 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 593. Up to 68 conditions per place. [2023-11-23 22:31:27,923 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 22 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2023-11-23 22:31:27,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 418 transitions, 900 flow [2023-11-23 22:31:27,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-23 22:31:27,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-23 22:31:27,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-23 22:31:27,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-23 22:31:27,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:27,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-23 22:31:27,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:27,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:27,941 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:27,942 INFO L175 Difference]: Start difference. First operand has 413 places, 419 transitions, 854 flow. Second operand 3 states and 1345 transitions. [2023-11-23 22:31:27,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 418 transitions, 900 flow [2023-11-23 22:31:27,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 418 transitions, 896 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:31:27,952 INFO L231 Difference]: Finished difference. Result has 412 places, 418 transitions, 852 flow [2023-11-23 22:31:27,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=412, PETRI_TRANSITIONS=418} [2023-11-23 22:31:27,954 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -15 predicate places. [2023-11-23 22:31:27,955 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 418 transitions, 852 flow [2023-11-23 22:31:27,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:27,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:27,957 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] [2023-11-23 22:31:27,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 22:31:27,957 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:27,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:27,958 INFO L85 PathProgramCache]: Analyzing trace with hash 406414307, now seen corresponding path program 1 times [2023-11-23 22:31:27,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:27,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615367407] [2023-11-23 22:31:27,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:27,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:28,010 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-23 22:31:28,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:28,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615367407] [2023-11-23 22:31:28,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615367407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:28,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:28,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:28,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502801767] [2023-11-23 22:31:28,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:28,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:28,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:28,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:28,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:28,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-23 22:31:28,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 418 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:28,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:28,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-23 22:31:28,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:28,210 INFO L124 PetriNetUnfolderBase]: 40/552 cut-off events. [2023-11-23 22:31:28,210 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-23 22:31:28,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 552 events. 40/552 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1630 event pairs, 20 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 581. Up to 68 conditions per place. [2023-11-23 22:31:28,223 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 22 selfloop transitions, 2 changer transitions 0/417 dead transitions. [2023-11-23 22:31:28,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 417 transitions, 898 flow [2023-11-23 22:31:28,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:28,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-23 22:31:28,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-23 22:31:28,228 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-23 22:31:28,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-23 22:31:28,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:28,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-23 22:31:28,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:28,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:28,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:28,240 INFO L175 Difference]: Start difference. First operand has 412 places, 418 transitions, 852 flow. Second operand 3 states and 1345 transitions. [2023-11-23 22:31:28,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 417 transitions, 898 flow [2023-11-23 22:31:28,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 417 transitions, 894 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:31:28,253 INFO L231 Difference]: Finished difference. Result has 411 places, 417 transitions, 850 flow [2023-11-23 22:31:28,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=411, PETRI_TRANSITIONS=417} [2023-11-23 22:31:28,257 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -16 predicate places. [2023-11-23 22:31:28,257 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 417 transitions, 850 flow [2023-11-23 22:31:28,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:28,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:28,259 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] [2023-11-23 22:31:28,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 22:31:28,260 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:28,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:28,261 INFO L85 PathProgramCache]: Analyzing trace with hash 302023988, now seen corresponding path program 1 times [2023-11-23 22:31:28,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:28,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030428181] [2023-11-23 22:31:28,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:28,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:28,353 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-23 22:31:28,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:28,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030428181] [2023-11-23 22:31:28,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030428181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:28,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:28,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:28,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143326778] [2023-11-23 22:31:28,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:28,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:28,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:28,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:28,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:28,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-23 22:31:28,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 417 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:28,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:28,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-23 22:31:28,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:28,548 INFO L124 PetriNetUnfolderBase]: 40/551 cut-off events. [2023-11-23 22:31:28,548 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-23 22:31:28,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 551 events. 40/551 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1570 event pairs, 20 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 569. Up to 68 conditions per place. [2023-11-23 22:31:28,566 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 22 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2023-11-23 22:31:28,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 416 transitions, 896 flow [2023-11-23 22:31:28,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:28,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-23 22:31:28,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-23 22:31:28,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-23 22:31:28,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-23 22:31:28,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:28,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-23 22:31:28,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:28,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:28,582 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:28,583 INFO L175 Difference]: Start difference. First operand has 411 places, 417 transitions, 850 flow. Second operand 3 states and 1345 transitions. [2023-11-23 22:31:28,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 416 transitions, 896 flow [2023-11-23 22:31:28,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 416 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:31:28,593 INFO L231 Difference]: Finished difference. Result has 410 places, 416 transitions, 848 flow [2023-11-23 22:31:28,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=410, PETRI_TRANSITIONS=416} [2023-11-23 22:31:28,597 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -17 predicate places. [2023-11-23 22:31:28,598 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 416 transitions, 848 flow [2023-11-23 22:31:28,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:28,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:28,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:28,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 22:31:28,600 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:28,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:28,601 INFO L85 PathProgramCache]: Analyzing trace with hash -497961939, now seen corresponding path program 1 times [2023-11-23 22:31:28,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:28,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429348397] [2023-11-23 22:31:28,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:28,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:28,678 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-23 22:31:28,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:28,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429348397] [2023-11-23 22:31:28,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429348397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:28,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:28,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:28,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161028353] [2023-11-23 22:31:28,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:28,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:28,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:28,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:28,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:28,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 475 [2023-11-23 22:31:28,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 416 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 436.3333333333333) internal successors, (1309), 3 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:28,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:28,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 475 [2023-11-23 22:31:28,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:29,977 INFO L124 PetriNetUnfolderBase]: 758/4855 cut-off events. [2023-11-23 22:31:29,977 INFO L125 PetriNetUnfolderBase]: For 63/80 co-relation queries the response was YES. [2023-11-23 22:31:30,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5866 conditions, 4855 events. 758/4855 cut-off events. For 63/80 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 45305 event pairs, 387 based on Foata normal form. 0/3573 useless extension candidates. Maximal degree in co-relation 5797. Up to 942 conditions per place. [2023-11-23 22:31:30,109 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 27 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2023-11-23 22:31:30,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 415 transitions, 904 flow [2023-11-23 22:31:30,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1335 transitions. [2023-11-23 22:31:30,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9368421052631579 [2023-11-23 22:31:30,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1335 transitions. [2023-11-23 22:31:30,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1335 transitions. [2023-11-23 22:31:30,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:30,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1335 transitions. [2023-11-23 22:31:30,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 445.0) internal successors, (1335), 3 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:30,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:30,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:30,125 INFO L175 Difference]: Start difference. First operand has 410 places, 416 transitions, 848 flow. Second operand 3 states and 1335 transitions. [2023-11-23 22:31:30,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 415 transitions, 904 flow [2023-11-23 22:31:30,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 415 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:31:30,136 INFO L231 Difference]: Finished difference. Result has 409 places, 415 transitions, 846 flow [2023-11-23 22:31:30,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=409, PETRI_TRANSITIONS=415} [2023-11-23 22:31:30,138 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -18 predicate places. [2023-11-23 22:31:30,138 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 415 transitions, 846 flow [2023-11-23 22:31:30,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 436.3333333333333) internal successors, (1309), 3 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:30,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:30,140 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] [2023-11-23 22:31:30,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 22:31:30,140 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:30,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:30,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1051112528, now seen corresponding path program 1 times [2023-11-23 22:31:30,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:30,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691443485] [2023-11-23 22:31:30,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:30,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:30,261 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-23 22:31:30,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:30,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691443485] [2023-11-23 22:31:30,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691443485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:30,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:30,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:30,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914722907] [2023-11-23 22:31:30,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:30,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:30,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:30,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:30,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:30,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-23 22:31:30,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 415 transitions, 846 flow. Second operand has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:30,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:30,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-23 22:31:30,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:30,436 INFO L124 PetriNetUnfolderBase]: 55/545 cut-off events. [2023-11-23 22:31:30,436 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2023-11-23 22:31:30,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 545 events. 55/545 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1914 event pairs, 30 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 617. Up to 90 conditions per place. [2023-11-23 22:31:30,447 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 29 selfloop transitions, 3 changer transitions 0/415 dead transitions. [2023-11-23 22:31:30,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 415 transitions, 915 flow [2023-11-23 22:31:30,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1340 transitions. [2023-11-23 22:31:30,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9403508771929825 [2023-11-23 22:31:30,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1340 transitions. [2023-11-23 22:31:30,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1340 transitions. [2023-11-23 22:31:30,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:30,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1340 transitions. [2023-11-23 22:31:30,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 446.6666666666667) internal successors, (1340), 3 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:30,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:30,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:30,463 INFO L175 Difference]: Start difference. First operand has 409 places, 415 transitions, 846 flow. Second operand 3 states and 1340 transitions. [2023-11-23 22:31:30,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 415 transitions, 915 flow [2023-11-23 22:31:30,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 415 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:31:30,474 INFO L231 Difference]: Finished difference. Result has 404 places, 410 transitions, 843 flow [2023-11-23 22:31:30,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=843, PETRI_PLACES=404, PETRI_TRANSITIONS=410} [2023-11-23 22:31:30,476 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -23 predicate places. [2023-11-23 22:31:30,477 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 410 transitions, 843 flow [2023-11-23 22:31:30,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:30,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:30,478 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] [2023-11-23 22:31:30,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 22:31:30,478 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:30,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:30,479 INFO L85 PathProgramCache]: Analyzing trace with hash 801853608, now seen corresponding path program 1 times [2023-11-23 22:31:30,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:30,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980140545] [2023-11-23 22:31:30,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:30,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:30,526 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-23 22:31:30,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:30,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980140545] [2023-11-23 22:31:30,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980140545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:30,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:30,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:30,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61853603] [2023-11-23 22:31:30,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:30,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:30,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:30,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:30,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:30,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-23 22:31:30,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 410 transitions, 843 flow. Second operand has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:30,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:30,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-23 22:31:30,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:30,715 INFO L124 PetriNetUnfolderBase]: 55/540 cut-off events. [2023-11-23 22:31:30,715 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-23 22:31:30,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 540 events. 55/540 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1897 event pairs, 30 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 600. Up to 90 conditions per place. [2023-11-23 22:31:30,727 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 29 selfloop transitions, 3 changer transitions 0/410 dead transitions. [2023-11-23 22:31:30,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 410 transitions, 912 flow [2023-11-23 22:31:30,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1340 transitions. [2023-11-23 22:31:30,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9403508771929825 [2023-11-23 22:31:30,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1340 transitions. [2023-11-23 22:31:30,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1340 transitions. [2023-11-23 22:31:30,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:30,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1340 transitions. [2023-11-23 22:31:30,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 446.6666666666667) internal successors, (1340), 3 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:30,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:30,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:30,742 INFO L175 Difference]: Start difference. First operand has 404 places, 410 transitions, 843 flow. Second operand 3 states and 1340 transitions. [2023-11-23 22:31:30,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 410 transitions, 912 flow [2023-11-23 22:31:30,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 410 transitions, 909 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-23 22:31:30,753 INFO L231 Difference]: Finished difference. Result has 400 places, 405 transitions, 841 flow [2023-11-23 22:31:30,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=841, PETRI_PLACES=400, PETRI_TRANSITIONS=405} [2023-11-23 22:31:30,754 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -27 predicate places. [2023-11-23 22:31:30,755 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 405 transitions, 841 flow [2023-11-23 22:31:30,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:30,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:30,756 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] [2023-11-23 22:31:30,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 22:31:30,757 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:30,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:30,757 INFO L85 PathProgramCache]: Analyzing trace with hash -999268320, now seen corresponding path program 1 times [2023-11-23 22:31:30,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:30,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084846889] [2023-11-23 22:31:30,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:30,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:30,811 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-23 22:31:30,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:30,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084846889] [2023-11-23 22:31:30,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084846889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:30,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:30,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:30,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095113212] [2023-11-23 22:31:30,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:30,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:30,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:30,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:30,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:30,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-23 22:31:30,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 405 transitions, 841 flow. Second operand has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:30,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:30,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-23 22:31:30,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:31,122 INFO L124 PetriNetUnfolderBase]: 71/899 cut-off events. [2023-11-23 22:31:31,122 INFO L125 PetriNetUnfolderBase]: For 24/28 co-relation queries the response was YES. [2023-11-23 22:31:31,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 899 events. 71/899 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4399 event pairs, 25 based on Foata normal form. 0/752 useless extension candidates. Maximal degree in co-relation 971. Up to 95 conditions per place. [2023-11-23 22:31:31,144 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 32 selfloop transitions, 3 changer transitions 0/408 dead transitions. [2023-11-23 22:31:31,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 408 transitions, 925 flow [2023-11-23 22:31:31,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1343 transitions. [2023-11-23 22:31:31,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9424561403508772 [2023-11-23 22:31:31,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1343 transitions. [2023-11-23 22:31:31,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1343 transitions. [2023-11-23 22:31:31,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:31,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1343 transitions. [2023-11-23 22:31:31,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:31,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:31,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:31,162 INFO L175 Difference]: Start difference. First operand has 400 places, 405 transitions, 841 flow. Second operand 3 states and 1343 transitions. [2023-11-23 22:31:31,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 408 transitions, 925 flow [2023-11-23 22:31:31,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 408 transitions, 922 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-23 22:31:31,176 INFO L231 Difference]: Finished difference. Result has 396 places, 400 transitions, 839 flow [2023-11-23 22:31:31,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=839, PETRI_PLACES=396, PETRI_TRANSITIONS=400} [2023-11-23 22:31:31,178 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -31 predicate places. [2023-11-23 22:31:31,178 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 400 transitions, 839 flow [2023-11-23 22:31:31,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:31,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:31,180 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-23 22:31:31,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 22:31:31,180 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:31,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:31,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1771337507, now seen corresponding path program 1 times [2023-11-23 22:31:31,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:31,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833079383] [2023-11-23 22:31:31,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:31,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:31,233 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-23 22:31:31,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:31,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833079383] [2023-11-23 22:31:31,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833079383] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:31,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:31,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:31,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585007235] [2023-11-23 22:31:31,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:31,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:31,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:31,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:31,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:31,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-23 22:31:31,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 400 transitions, 839 flow. Second operand has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:31,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:31,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-23 22:31:31,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:31,647 INFO L124 PetriNetUnfolderBase]: 103/1163 cut-off events. [2023-11-23 22:31:31,647 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-11-23 22:31:31,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1433 conditions, 1163 events. 103/1163 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6781 event pairs, 8 based on Foata normal form. 0/1000 useless extension candidates. Maximal degree in co-relation 912. Up to 154 conditions per place. [2023-11-23 22:31:31,680 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 34 selfloop transitions, 3 changer transitions 0/405 dead transitions. [2023-11-23 22:31:31,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 405 transitions, 933 flow [2023-11-23 22:31:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-23 22:31:31,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-23 22:31:31,688 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-23 22:31:31,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-23 22:31:31,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:31,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-23 22:31:31,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:31,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:31,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:31,700 INFO L175 Difference]: Start difference. First operand has 396 places, 400 transitions, 839 flow. Second operand 3 states and 1345 transitions. [2023-11-23 22:31:31,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 405 transitions, 933 flow [2023-11-23 22:31:31,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 405 transitions, 930 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-23 22:31:31,716 INFO L231 Difference]: Finished difference. Result has 392 places, 395 transitions, 837 flow [2023-11-23 22:31:31,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=392, PETRI_TRANSITIONS=395} [2023-11-23 22:31:31,718 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -35 predicate places. [2023-11-23 22:31:31,718 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 395 transitions, 837 flow [2023-11-23 22:31:31,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:31,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:31,719 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-23 22:31:31,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 22:31:31,720 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:31,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:31,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1775846873, now seen corresponding path program 1 times [2023-11-23 22:31:31,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:31,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831740904] [2023-11-23 22:31:31,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:31,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:31,793 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-23 22:31:31,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:31,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831740904] [2023-11-23 22:31:31,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831740904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:31,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:31,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:31,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037249530] [2023-11-23 22:31:31,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:31,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:31,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:31,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:31,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:31,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-23 22:31:31,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 395 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:31,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:31,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-23 22:31:31,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:32,380 INFO L124 PetriNetUnfolderBase]: 199/1794 cut-off events. [2023-11-23 22:31:32,380 INFO L125 PetriNetUnfolderBase]: For 103/111 co-relation queries the response was YES. [2023-11-23 22:31:32,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 1794 events. 199/1794 cut-off events. For 103/111 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 12601 event pairs, 98 based on Foata normal form. 0/1517 useless extension candidates. Maximal degree in co-relation 1586. Up to 302 conditions per place. [2023-11-23 22:31:32,438 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 33 selfloop transitions, 3 changer transitions 0/399 dead transitions. [2023-11-23 22:31:32,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 399 transitions, 926 flow [2023-11-23 22:31:32,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:32,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1344 transitions. [2023-11-23 22:31:32,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9431578947368421 [2023-11-23 22:31:32,446 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1344 transitions. [2023-11-23 22:31:32,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1344 transitions. [2023-11-23 22:31:32,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:32,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1344 transitions. [2023-11-23 22:31:32,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.0) internal successors, (1344), 3 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:32,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:32,458 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:32,458 INFO L175 Difference]: Start difference. First operand has 392 places, 395 transitions, 837 flow. Second operand 3 states and 1344 transitions. [2023-11-23 22:31:32,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 399 transitions, 926 flow [2023-11-23 22:31:32,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 399 transitions, 923 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-23 22:31:32,475 INFO L231 Difference]: Finished difference. Result has 388 places, 390 transitions, 835 flow [2023-11-23 22:31:32,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=835, PETRI_PLACES=388, PETRI_TRANSITIONS=390} [2023-11-23 22:31:32,478 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -39 predicate places. [2023-11-23 22:31:32,478 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 390 transitions, 835 flow [2023-11-23 22:31:32,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:32,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:32,479 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] [2023-11-23 22:31:32,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 22:31:32,480 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:32,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:32,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1448319996, now seen corresponding path program 1 times [2023-11-23 22:31:32,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:32,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796473686] [2023-11-23 22:31:32,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:32,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:32,535 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-23 22:31:32,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:32,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796473686] [2023-11-23 22:31:32,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796473686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:32,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:32,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:32,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084967733] [2023-11-23 22:31:32,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:32,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:32,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:32,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:32,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:32,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-23 22:31:32,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 390 transitions, 835 flow. Second operand has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:32,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:32,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-23 22:31:32,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:32,982 INFO L124 PetriNetUnfolderBase]: 175/1479 cut-off events. [2023-11-23 22:31:32,983 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2023-11-23 22:31:33,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 1479 events. 175/1479 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9516 event pairs, 50 based on Foata normal form. 1/1278 useless extension candidates. Maximal degree in co-relation 996. Up to 269 conditions per place. [2023-11-23 22:31:33,019 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 33 selfloop transitions, 3 changer transitions 8/396 dead transitions. [2023-11-23 22:31:33,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 396 transitions, 932 flow [2023-11-23 22:31:33,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-23 22:31:33,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-23 22:31:33,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-23 22:31:33,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-23 22:31:33,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:33,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-23 22:31:33,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:33,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:33,035 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:33,035 INFO L175 Difference]: Start difference. First operand has 388 places, 390 transitions, 835 flow. Second operand 3 states and 1345 transitions. [2023-11-23 22:31:33,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 396 transitions, 932 flow [2023-11-23 22:31:33,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 396 transitions, 929 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-23 22:31:33,047 INFO L231 Difference]: Finished difference. Result has 384 places, 377 transitions, 817 flow [2023-11-23 22:31:33,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=817, PETRI_PLACES=384, PETRI_TRANSITIONS=377} [2023-11-23 22:31:33,050 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -43 predicate places. [2023-11-23 22:31:33,050 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 377 transitions, 817 flow [2023-11-23 22:31:33,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:33,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:33,051 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] [2023-11-23 22:31:33,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 22:31:33,051 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:33,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:33,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1239713763, now seen corresponding path program 1 times [2023-11-23 22:31:33,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:33,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024571475] [2023-11-23 22:31:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:33,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:33,109 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-23 22:31:33,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:33,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024571475] [2023-11-23 22:31:33,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024571475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:33,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:33,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:33,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212010358] [2023-11-23 22:31:33,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:33,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:33,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:33,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:33,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:33,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 475 [2023-11-23 22:31:33,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 377 transitions, 817 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:33,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:33,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 475 [2023-11-23 22:31:33,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:44,998 INFO L124 PetriNetUnfolderBase]: 17906/61411 cut-off events. [2023-11-23 22:31:44,999 INFO L125 PetriNetUnfolderBase]: For 1608/1813 co-relation queries the response was YES. [2023-11-23 22:31:45,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89875 conditions, 61411 events. 17906/61411 cut-off events. For 1608/1813 co-relation queries the response was YES. Maximal size of possible extension queue 2245. Compared 859897 event pairs, 8762 based on Foata normal form. 1/53056 useless extension candidates. Maximal degree in co-relation 34226. Up to 21614 conditions per place. [2023-11-23 22:31:46,503 INFO L140 encePairwiseOnDemand]: 457/475 looper letters, 29 selfloop transitions, 6 changer transitions 59/376 dead transitions. [2023-11-23 22:31:46,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 376 transitions, 914 flow [2023-11-23 22:31:46,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:46,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1310 transitions. [2023-11-23 22:31:46,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9192982456140351 [2023-11-23 22:31:46,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1310 transitions. [2023-11-23 22:31:46,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1310 transitions. [2023-11-23 22:31:46,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:46,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1310 transitions. [2023-11-23 22:31:46,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 436.6666666666667) internal successors, (1310), 3 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:46,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:46,524 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:46,524 INFO L175 Difference]: Start difference. First operand has 384 places, 377 transitions, 817 flow. Second operand 3 states and 1310 transitions. [2023-11-23 22:31:46,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 376 transitions, 914 flow [2023-11-23 22:31:46,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 376 transitions, 911 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-23 22:31:46,781 INFO L231 Difference]: Finished difference. Result has 367 places, 312 transitions, 713 flow [2023-11-23 22:31:46,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=367, PETRI_TRANSITIONS=312} [2023-11-23 22:31:46,783 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -60 predicate places. [2023-11-23 22:31:46,783 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 312 transitions, 713 flow [2023-11-23 22:31:46,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:46,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:46,785 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] [2023-11-23 22:31:46,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 22:31:46,785 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:46,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1156405926, now seen corresponding path program 1 times [2023-11-23 22:31:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:46,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310653808] [2023-11-23 22:31:46,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:46,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:46,854 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-23 22:31:46,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:46,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310653808] [2023-11-23 22:31:46,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310653808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:46,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:46,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:46,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413451443] [2023-11-23 22:31:46,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:46,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:46,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:46,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:46,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:46,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-23 22:31:46,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 312 transitions, 713 flow. Second operand has 3 states, 3 states have (on average 445.0) internal successors, (1335), 3 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:46,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:46,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-23 22:31:46,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:48,894 INFO L124 PetriNetUnfolderBase]: 1604/7610 cut-off events. [2023-11-23 22:31:48,894 INFO L125 PetriNetUnfolderBase]: For 41/49 co-relation queries the response was YES. [2023-11-23 22:31:49,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10649 conditions, 7610 events. 1604/7610 cut-off events. For 41/49 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 82646 event pairs, 362 based on Foata normal form. 0/6408 useless extension candidates. Maximal degree in co-relation 5495. Up to 1748 conditions per place. [2023-11-23 22:31:49,116 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/316 dead transitions. [2023-11-23 22:31:49,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 316 transitions, 778 flow [2023-11-23 22:31:49,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-23 22:31:49,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-23 22:31:49,122 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-23 22:31:49,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-23 22:31:49,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:49,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-23 22:31:49,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:49,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:49,132 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:49,132 INFO L175 Difference]: Start difference. First operand has 367 places, 312 transitions, 713 flow. Second operand 3 states and 1352 transitions. [2023-11-23 22:31:49,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 316 transitions, 778 flow [2023-11-23 22:31:49,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 316 transitions, 778 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-23 22:31:49,145 INFO L231 Difference]: Finished difference. Result has 315 places, 311 transitions, 715 flow [2023-11-23 22:31:49,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=715, PETRI_PLACES=315, PETRI_TRANSITIONS=311} [2023-11-23 22:31:49,148 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -112 predicate places. [2023-11-23 22:31:49,149 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 311 transitions, 715 flow [2023-11-23 22:31:49,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 445.0) internal successors, (1335), 3 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:49,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:49,150 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-23 22:31:49,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 22:31:49,150 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:49,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:49,151 INFO L85 PathProgramCache]: Analyzing trace with hash 702577034, now seen corresponding path program 1 times [2023-11-23 22:31:49,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:49,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620528529] [2023-11-23 22:31:49,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:49,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:49,216 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-23 22:31:49,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:49,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620528529] [2023-11-23 22:31:49,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620528529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:49,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:49,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:49,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469506266] [2023-11-23 22:31:49,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:49,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:49,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:49,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:49,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:49,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-23 22:31:49,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 311 transitions, 715 flow. Second operand has 3 states, 3 states have (on average 445.3333333333333) internal successors, (1336), 3 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:49,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:49,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-23 22:31:49,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:52,183 INFO L124 PetriNetUnfolderBase]: 2799/13425 cut-off events. [2023-11-23 22:31:52,183 INFO L125 PetriNetUnfolderBase]: For 253/257 co-relation queries the response was YES. [2023-11-23 22:31:52,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18982 conditions, 13425 events. 2799/13425 cut-off events. For 253/257 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 163726 event pairs, 798 based on Foata normal form. 0/11627 useless extension candidates. Maximal degree in co-relation 18382. Up to 2661 conditions per place. [2023-11-23 22:31:52,455 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2023-11-23 22:31:52,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 315 transitions, 780 flow [2023-11-23 22:31:52,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-23 22:31:52,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-23 22:31:52,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-23 22:31:52,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-23 22:31:52,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:52,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-23 22:31:52,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:52,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:52,469 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:52,469 INFO L175 Difference]: Start difference. First operand has 315 places, 311 transitions, 715 flow. Second operand 3 states and 1352 transitions. [2023-11-23 22:31:52,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 315 transitions, 780 flow [2023-11-23 22:31:52,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 315 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:31:52,483 INFO L231 Difference]: Finished difference. Result has 314 places, 310 transitions, 713 flow [2023-11-23 22:31:52,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=314, PETRI_TRANSITIONS=310} [2023-11-23 22:31:52,484 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -113 predicate places. [2023-11-23 22:31:52,484 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 310 transitions, 713 flow [2023-11-23 22:31:52,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 445.3333333333333) internal successors, (1336), 3 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:52,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:52,485 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] [2023-11-23 22:31:52,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 22:31:52,485 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:52,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash -110040722, now seen corresponding path program 1 times [2023-11-23 22:31:52,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:52,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741066472] [2023-11-23 22:31:52,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:52,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:52,538 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-23 22:31:52,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:52,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741066472] [2023-11-23 22:31:52,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741066472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:52,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:52,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:52,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954818900] [2023-11-23 22:31:52,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:52,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:52,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:52,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:52,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:52,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-23 22:31:52,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 310 transitions, 713 flow. Second operand has 3 states, 3 states have (on average 445.3333333333333) internal successors, (1336), 3 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:52,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:52,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-23 22:31:52,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:53,595 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, Black: 511#true, 33#$Ultimate##0true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 521#true, 516#true, 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:53,596 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-23 22:31:53,596 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-23 22:31:53,596 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-23 22:31:53,596 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-23 22:31:53,597 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:53,597 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-23 22:31:53,597 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-23 22:31:53,597 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-23 22:31:53,597 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-23 22:31:53,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 540#true, 33#$Ultimate##0true, 32#L57-3true, 218#$Ultimate##0true, Black: 521#true, 516#true, 526#true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:53,607 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-23 22:31:53,607 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-23 22:31:53,607 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-23 22:31:53,608 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-23 22:31:53,608 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 540#true, 32#L57-3true, Black: 516#true, 50#L73-3true, 218#$Ultimate##0true, Black: 521#true, 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:53,609 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-23 22:31:53,609 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-23 22:31:53,609 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-23 22:31:53,609 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-23 22:31:53,869 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 33#$Ultimate##0true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 521#true, 516#true, 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:53,869 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-23 22:31:53,870 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-23 22:31:53,870 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-23 22:31:53,870 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-23 22:31:53,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:53,870 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-23 22:31:53,871 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-23 22:31:53,871 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-23 22:31:53,871 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-23 22:31:53,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, Black: 521#true, Black: 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:53,988 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-23 22:31:53,989 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-23 22:31:53,989 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-23 22:31:53,989 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-23 22:31:53,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, Black: 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:53,990 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-23 22:31:53,990 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-23 22:31:53,990 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-23 22:31:53,990 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-23 22:31:53,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 218#$Ultimate##0true, Black: 521#true, Black: 526#true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:53,998 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-23 22:31:53,998 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-23 22:31:53,998 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-23 22:31:53,998 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-23 22:31:53,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 218#$Ultimate##0true, Black: 521#true, Black: 526#true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:53,999 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-23 22:31:53,999 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-23 22:31:53,999 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-23 22:31:53,999 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-23 22:31:54,050 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 33#$Ultimate##0true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 521#true, 306#L108-4true, 516#true, 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,050 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-23 22:31:54,050 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-23 22:31:54,051 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-23 22:31:54,051 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-23 22:31:54,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 306#L108-4true, 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,051 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-23 22:31:54,051 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-23 22:31:54,052 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-23 22:31:54,052 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:54,053 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 33#$Ultimate##0true, 32#L57-3true, 434#L81-3true, Black: 521#true, 306#L108-4true, 516#true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,053 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-23 22:31:54,054 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-23 22:31:54,054 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-23 22:31:54,054 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:54,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 540#true, 33#$Ultimate##0true, 32#L57-3true, 218#$Ultimate##0true, Black: 521#true, 306#L108-4true, 516#true, 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,066 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-23 22:31:54,066 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-23 22:31:54,066 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-23 22:31:54,066 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-23 22:31:54,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 540#true, 32#L57-3true, Black: 516#true, 50#L73-3true, 218#$Ultimate##0true, Black: 521#true, 306#L108-4true, 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,066 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-23 22:31:54,066 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:54,066 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-23 22:31:54,067 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-23 22:31:54,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 540#true, 33#$Ultimate##0true, 32#L57-3true, 434#L81-3true, 218#$Ultimate##0true, Black: 521#true, 306#L108-4true, 516#true, Black: 526#true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:54,068 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-23 22:31:54,068 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-23 22:31:54,068 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:54,068 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-23 22:31:54,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 218#$Ultimate##0true, 434#L81-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,326 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-23 22:31:54,326 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-23 22:31:54,326 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-23 22:31:54,326 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:54,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, Black: 521#true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:54,332 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-23 22:31:54,332 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-23 22:31:54,332 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-23 22:31:54,332 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-23 22:31:54,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:54,334 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-23 22:31:54,335 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-23 22:31:54,335 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-23 22:31:54,335 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-23 22:31:54,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 33#$Ultimate##0true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 521#true, 306#L108-4true, 516#true, 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,390 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-23 22:31:54,390 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:54,391 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-23 22:31:54,391 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-23 22:31:54,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 306#L108-4true, 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,391 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-23 22:31:54,391 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-23 22:31:54,392 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-23 22:31:54,392 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-23 22:31:54,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 33#$Ultimate##0true, 32#L57-3true, 434#L81-3true, Black: 521#true, 306#L108-4true, 516#true, Black: 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:54,394 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-23 22:31:54,394 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-23 22:31:54,394 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-23 22:31:54,394 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-23 22:31:54,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,512 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-23 22:31:54,513 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-23 22:31:54,513 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-23 22:31:54,513 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:54,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,513 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-23 22:31:54,513 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-23 22:31:54,514 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-23 22:31:54,514 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-23 22:31:54,515 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 434#L81-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,515 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-23 22:31:54,515 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-23 22:31:54,515 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-23 22:31:54,516 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:54,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 218#$Ultimate##0true, Black: 521#true, 306#L108-4true, Black: 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,525 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-23 22:31:54,525 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-23 22:31:54,525 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-23 22:31:54,526 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:54,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 218#$Ultimate##0true, Black: 521#true, 306#L108-4true, Black: 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,526 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-23 22:31:54,526 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-23 22:31:54,527 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-23 22:31:54,527 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-23 22:31:54,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 218#$Ultimate##0true, 434#L81-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:54,528 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-23 22:31:54,528 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-23 22:31:54,529 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-23 22:31:54,529 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:54,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 434#L81-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,700 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-23 22:31:54,700 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-23 22:31:54,700 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-23 22:31:54,700 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-23 22:31:54,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 540#true, 32#L57-3true, Black: 516#true, 50#L73-3true, 434#L81-3true, 218#$Ultimate##0true, Black: 521#true, 306#L108-4true, Black: 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:54,706 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-23 22:31:54,707 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-23 22:31:54,707 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-23 22:31:54,707 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-23 22:31:54,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,856 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-23 22:31:54,856 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-23 22:31:54,857 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-23 22:31:54,857 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-23 22:31:54,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:54,858 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-23 22:31:54,858 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-23 22:31:54,858 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-23 22:31:54,858 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:54,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 434#L81-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:54,859 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-23 22:31:54,859 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-23 22:31:54,860 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-23 22:31:54,860 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-23 22:31:54,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 434#L81-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:54,997 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-23 22:31:54,997 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-23 22:31:54,997 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-23 22:31:54,997 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-23 22:31:55,944 INFO L124 PetriNetUnfolderBase]: 2898/13264 cut-off events. [2023-11-23 22:31:55,944 INFO L125 PetriNetUnfolderBase]: For 486/514 co-relation queries the response was YES. [2023-11-23 22:31:56,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19437 conditions, 13264 events. 2898/13264 cut-off events. For 486/514 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 159852 event pairs, 892 based on Foata normal form. 0/11650 useless extension candidates. Maximal degree in co-relation 18633. Up to 2455 conditions per place. [2023-11-23 22:31:56,278 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2023-11-23 22:31:56,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 314 transitions, 778 flow [2023-11-23 22:31:56,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-23 22:31:56,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-23 22:31:56,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-23 22:31:56,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-23 22:31:56,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:56,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-23 22:31:56,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:56,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:56,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:56,298 INFO L175 Difference]: Start difference. First operand has 314 places, 310 transitions, 713 flow. Second operand 3 states and 1352 transitions. [2023-11-23 22:31:56,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 314 transitions, 778 flow [2023-11-23 22:31:56,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 314 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:31:56,312 INFO L231 Difference]: Finished difference. Result has 313 places, 309 transitions, 711 flow [2023-11-23 22:31:56,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=711, PETRI_PLACES=313, PETRI_TRANSITIONS=309} [2023-11-23 22:31:56,314 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -114 predicate places. [2023-11-23 22:31:56,314 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 309 transitions, 711 flow [2023-11-23 22:31:56,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 445.3333333333333) internal successors, (1336), 3 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:56,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:56,315 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] [2023-11-23 22:31:56,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 22:31:56,315 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:56,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:56,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1054394131, now seen corresponding path program 1 times [2023-11-23 22:31:56,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:56,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254748241] [2023-11-23 22:31:56,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:56,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:56,388 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-23 22:31:56,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:56,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254748241] [2023-11-23 22:31:56,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254748241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:56,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:56,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:56,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020606149] [2023-11-23 22:31:56,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:56,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:56,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:56,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:56,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:56,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-23 22:31:56,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 309 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 445.6666666666667) internal successors, (1337), 3 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:56,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:56,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-23 22:31:56,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:58,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 548#true, 306#L108-4true, 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:58,048 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-23 22:31:58,048 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-23 22:31:58,048 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:58,048 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-23 22:31:58,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 434#L81-3true, Black: 521#true, 548#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:58,049 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-23 22:31:58,049 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-23 22:31:58,049 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-23 22:31:58,050 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-23 22:31:58,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 218#$Ultimate##0true, Black: 521#true, 548#true, 306#L108-4true, 526#true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:58,054 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-23 22:31:58,054 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:58,054 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-23 22:31:58,054 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-23 22:31:58,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 434#L81-3true, 218#$Ultimate##0true, Black: 521#true, 548#true, 306#L108-4true, Black: 526#true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:58,055 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-23 22:31:58,055 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-23 22:31:58,055 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-23 22:31:58,055 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-23 22:31:58,217 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 548#true, 306#L108-4true, 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:58,217 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-23 22:31:58,218 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-23 22:31:58,218 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-23 22:31:58,218 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-23 22:31:58,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 434#L81-3true, Black: 521#true, 548#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-23 22:31:58,219 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-23 22:31:58,219 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-23 22:31:58,219 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-23 22:31:58,219 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-23 22:31:58,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 548#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:58,247 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-23 22:31:58,247 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:58,248 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-23 22:31:58,248 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-23 22:31:58,249 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 218#$Ultimate##0true, Black: 521#true, 548#true, 306#L108-4true, Black: 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:58,249 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-23 22:31:58,249 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-23 22:31:58,249 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-23 22:31:58,250 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:58,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 548#true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-23 22:31:58,366 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-23 22:31:58,366 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-23 22:31:58,367 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-23 22:31:58,367 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-23 22:31:59,232 INFO L124 PetriNetUnfolderBase]: 2506/11352 cut-off events. [2023-11-23 22:31:59,232 INFO L125 PetriNetUnfolderBase]: For 646/686 co-relation queries the response was YES. [2023-11-23 22:31:59,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16679 conditions, 11352 events. 2506/11352 cut-off events. For 646/686 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 131245 event pairs, 805 based on Foata normal form. 0/9927 useless extension candidates. Maximal degree in co-relation 15709. Up to 2102 conditions per place. [2023-11-23 22:31:59,494 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2023-11-23 22:31:59,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 313 transitions, 776 flow [2023-11-23 22:31:59,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-23 22:31:59,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-23 22:31:59,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-23 22:31:59,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-23 22:31:59,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:59,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-23 22:31:59,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:59,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:59,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:59,512 INFO L175 Difference]: Start difference. First operand has 313 places, 309 transitions, 711 flow. Second operand 3 states and 1352 transitions. [2023-11-23 22:31:59,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 313 transitions, 776 flow [2023-11-23 22:31:59,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 313 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:31:59,529 INFO L231 Difference]: Finished difference. Result has 312 places, 308 transitions, 709 flow [2023-11-23 22:31:59,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=709, PETRI_PLACES=312, PETRI_TRANSITIONS=308} [2023-11-23 22:31:59,530 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -115 predicate places. [2023-11-23 22:31:59,530 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 308 transitions, 709 flow [2023-11-23 22:31:59,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 445.6666666666667) internal successors, (1337), 3 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:59,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:59,531 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] [2023-11-23 22:31:59,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 22:31:59,532 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:31:59,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash 58412032, now seen corresponding path program 1 times [2023-11-23 22:31:59,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:59,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745435281] [2023-11-23 22:31:59,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:59,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:00,491 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-23 22:32:00,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:00,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745435281] [2023-11-23 22:32:00,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745435281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:00,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:00,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 22:32:00,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254377398] [2023-11-23 22:32:00,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:00,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:32:00,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:00,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:32:00,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:32:00,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 475 [2023-11-23 22:32:00,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 308 transitions, 709 flow. Second operand has 6 states, 6 states have (on average 446.1666666666667) internal successors, (2677), 6 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:00,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:32:00,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 475 [2023-11-23 22:32:00,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:32:02,187 INFO L124 PetriNetUnfolderBase]: 984/5101 cut-off events. [2023-11-23 22:32:02,188 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-11-23 22:32:02,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6940 conditions, 5101 events. 984/5101 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 48588 event pairs, 172 based on Foata normal form. 0/4454 useless extension candidates. Maximal degree in co-relation 6330. Up to 1176 conditions per place. [2023-11-23 22:32:02,288 INFO L140 encePairwiseOnDemand]: 470/475 looper letters, 14 selfloop transitions, 4 changer transitions 0/307 dead transitions. [2023-11-23 22:32:02,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 307 transitions, 743 flow [2023-11-23 22:32:02,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:32:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 22:32:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2683 transitions. [2023-11-23 22:32:02,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9414035087719298 [2023-11-23 22:32:02,299 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2683 transitions. [2023-11-23 22:32:02,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2683 transitions. [2023-11-23 22:32:02,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:32:02,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2683 transitions. [2023-11-23 22:32:02,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 447.1666666666667) internal successors, (2683), 6 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:02,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:02,322 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:02,322 INFO L175 Difference]: Start difference. First operand has 312 places, 308 transitions, 709 flow. Second operand 6 states and 2683 transitions. [2023-11-23 22:32:02,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 307 transitions, 743 flow [2023-11-23 22:32:02,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 307 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:32:02,335 INFO L231 Difference]: Finished difference. Result has 314 places, 307 transitions, 711 flow [2023-11-23 22:32:02,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=711, PETRI_PLACES=314, PETRI_TRANSITIONS=307} [2023-11-23 22:32:02,336 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -113 predicate places. [2023-11-23 22:32:02,337 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 307 transitions, 711 flow [2023-11-23 22:32:02,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 446.1666666666667) internal successors, (2677), 6 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:02,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:32:02,338 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] [2023-11-23 22:32:02,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 22:32:02,339 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread5Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:32:02,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:02,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1550933510, now seen corresponding path program 1 times [2023-11-23 22:32:02,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:02,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192256641] [2023-11-23 22:32:02,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:02,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:02,417 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-23 22:32:02,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:02,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192256641] [2023-11-23 22:32:02,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192256641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:02,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:02,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:32:02,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944344201] [2023-11-23 22:32:02,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:02,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:32:02,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:02,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:32:02,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:32:02,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-23 22:32:02,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 307 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 446.0) internal successors, (1338), 3 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:02,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:32:02,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-23 22:32:02,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:32:05,161 INFO L124 PetriNetUnfolderBase]: 2008/9178 cut-off events. [2023-11-23 22:32:05,161 INFO L125 PetriNetUnfolderBase]: For 496/526 co-relation queries the response was YES. [2023-11-23 22:32:05,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13292 conditions, 9178 events. 2008/9178 cut-off events. For 496/526 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 99574 event pairs, 659 based on Foata normal form. 0/8088 useless extension candidates. Maximal degree in co-relation 8753. Up to 1823 conditions per place. [2023-11-23 22:32:05,351 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2023-11-23 22:32:05,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 311 transitions, 776 flow [2023-11-23 22:32:05,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:32:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:32:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-23 22:32:05,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-23 22:32:05,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-23 22:32:05,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-23 22:32:05,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:32:05,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-23 22:32:05,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:05,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:05,368 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:05,368 INFO L175 Difference]: Start difference. First operand has 314 places, 307 transitions, 711 flow. Second operand 3 states and 1352 transitions. [2023-11-23 22:32:05,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 311 transitions, 776 flow [2023-11-23 22:32:05,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 311 transitions, 769 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-23 22:32:05,380 INFO L231 Difference]: Finished difference. Result has 311 places, 306 transitions, 706 flow [2023-11-23 22:32:05,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=311, PETRI_TRANSITIONS=306} [2023-11-23 22:32:05,381 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -116 predicate places. [2023-11-23 22:32:05,382 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 306 transitions, 706 flow [2023-11-23 22:32:05,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 446.0) internal successors, (1338), 3 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:05,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:32:05,383 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] [2023-11-23 22:32:05,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-23 22:32:05,383 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread6Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:32:05,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:05,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1639015021, now seen corresponding path program 1 times [2023-11-23 22:32:05,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:05,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949264634] [2023-11-23 22:32:05,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:05,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:05,443 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-23 22:32:05,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:05,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949264634] [2023-11-23 22:32:05,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949264634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:05,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:05,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:32:05,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806249917] [2023-11-23 22:32:05,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:05,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:32:05,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:05,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:32:05,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:32:05,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-23 22:32:05,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 306 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 446.3333333333333) internal successors, (1339), 3 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:05,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:32:05,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-23 22:32:05,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:32:06,850 INFO L124 PetriNetUnfolderBase]: 1480/6778 cut-off events. [2023-11-23 22:32:06,850 INFO L125 PetriNetUnfolderBase]: For 360/384 co-relation queries the response was YES. [2023-11-23 22:32:06,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9704 conditions, 6778 events. 1480/6778 cut-off events. For 360/384 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 67195 event pairs, 435 based on Foata normal form. 0/5962 useless extension candidates. Maximal degree in co-relation 8960. Up to 1488 conditions per place. [2023-11-23 22:32:06,991 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2023-11-23 22:32:06,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 310 transitions, 771 flow [2023-11-23 22:32:06,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:32:06,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:32:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-23 22:32:06,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-23 22:32:06,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-23 22:32:06,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-23 22:32:06,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:32:06,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-23 22:32:07,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:07,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:07,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:07,008 INFO L175 Difference]: Start difference. First operand has 311 places, 306 transitions, 706 flow. Second operand 3 states and 1352 transitions. [2023-11-23 22:32:07,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 310 transitions, 771 flow [2023-11-23 22:32:07,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 310 transitions, 767 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:32:07,022 INFO L231 Difference]: Finished difference. Result has 310 places, 305 transitions, 704 flow [2023-11-23 22:32:07,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=310, PETRI_TRANSITIONS=305} [2023-11-23 22:32:07,024 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -117 predicate places. [2023-11-23 22:32:07,024 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 305 transitions, 704 flow [2023-11-23 22:32:07,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 446.3333333333333) internal successors, (1339), 3 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:07,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:32:07,025 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-23 22:32:07,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-23 22:32:07,025 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:32:07,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:07,026 INFO L85 PathProgramCache]: Analyzing trace with hash -65903341, now seen corresponding path program 1 times [2023-11-23 22:32:07,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:07,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305206889] [2023-11-23 22:32:07,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:07,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:07,749 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-23 22:32:07,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:07,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305206889] [2023-11-23 22:32:07,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305206889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:07,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:07,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 22:32:07,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060544974] [2023-11-23 22:32:07,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:07,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:32:07,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:07,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:32:07,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:32:08,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 475 [2023-11-23 22:32:08,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 305 transitions, 704 flow. Second operand has 6 states, 6 states have (on average 446.3333333333333) internal successors, (2678), 6 states have internal predecessors, (2678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:08,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:32:08,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 475 [2023-11-23 22:32:08,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:32:08,969 INFO L124 PetriNetUnfolderBase]: 984/5037 cut-off events. [2023-11-23 22:32:08,969 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-11-23 22:32:09,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6816 conditions, 5037 events. 984/5037 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 47776 event pairs, 172 based on Foata normal form. 0/4454 useless extension candidates. Maximal degree in co-relation 6494. Up to 1176 conditions per place. [2023-11-23 22:32:09,056 INFO L140 encePairwiseOnDemand]: 470/475 looper letters, 14 selfloop transitions, 4 changer transitions 0/304 dead transitions. [2023-11-23 22:32:09,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 304 transitions, 738 flow [2023-11-23 22:32:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:32:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 22:32:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2683 transitions. [2023-11-23 22:32:09,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9414035087719298 [2023-11-23 22:32:09,065 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2683 transitions. [2023-11-23 22:32:09,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2683 transitions. [2023-11-23 22:32:09,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:32:09,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2683 transitions. [2023-11-23 22:32:09,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 447.1666666666667) internal successors, (2683), 6 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:09,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:09,082 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:09,082 INFO L175 Difference]: Start difference. First operand has 310 places, 305 transitions, 704 flow. Second operand 6 states and 2683 transitions. [2023-11-23 22:32:09,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 304 transitions, 738 flow [2023-11-23 22:32:09,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 304 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:32:09,092 INFO L231 Difference]: Finished difference. Result has 312 places, 304 transitions, 706 flow [2023-11-23 22:32:09,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=706, PETRI_PLACES=312, PETRI_TRANSITIONS=304} [2023-11-23 22:32:09,093 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -115 predicate places. [2023-11-23 22:32:09,094 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 304 transitions, 706 flow [2023-11-23 22:32:09,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 446.3333333333333) internal successors, (2678), 6 states have internal predecessors, (2678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:09,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:32:09,095 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-23 22:32:09,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-23 22:32:09,095 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-23 22:32:09,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:32:09,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1559852817, now seen corresponding path program 1 times [2023-11-23 22:32:09,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:32:09,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820011633] [2023-11-23 22:32:09,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:32:09,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:32:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:32:09,888 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-23 22:32:09,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:32:09,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820011633] [2023-11-23 22:32:09,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820011633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:32:09,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:32:09,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 22:32:09,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820602737] [2023-11-23 22:32:09,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:32:09,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:32:09,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:32:09,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:32:09,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:32:10,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 475 [2023-11-23 22:32:10,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 304 transitions, 706 flow. Second operand has 6 states, 6 states have (on average 446.5) internal successors, (2679), 6 states have internal predecessors, (2679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:32:10,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:32:10,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 475 [2023-11-23 22:32:10,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand