./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63d58f4c-1369-4133-a108-8da70e942182/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63d58f4c-1369-4133-a108-8da70e942182/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63d58f4c-1369-4133-a108-8da70e942182/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63d58f4c-1369-4133-a108-8da70e942182/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63d58f4c-1369-4133-a108-8da70e942182/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63d58f4c-1369-4133-a108-8da70e942182/bin/uautomizer-verify-VRDe98Ueme --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.4-dev-0e0057c [2023-11-26 11:58:05,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:58:05,709 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63d58f4c-1369-4133-a108-8da70e942182/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 11:58:05,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:58:05,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:58:05,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:58:05,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:58:05,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:58:05,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:58:05,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:58:05,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:58:05,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:58:05,763 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:58:05,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:58:05,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:58:05,765 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:58:05,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:58:05,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:58:05,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:58:05,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:58:05,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:58:05,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:58:05,769 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 11:58:05,769 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:58:05,770 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:58:05,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:58:05,771 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:58:05,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:58:05,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:58:05,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:58:05,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:58:05,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:58:05,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:58:05,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:58:05,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:58:05,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:58:05,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:58:05,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:58:05,776 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:58:05,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:58:05,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:58:05,778 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_63d58f4c-1369-4133-a108-8da70e942182/bin/uautomizer-verify-VRDe98Ueme/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_63d58f4c-1369-4133-a108-8da70e942182/bin/uautomizer-verify-VRDe98Ueme 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-26 11:58:06,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:58:06,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:58:06,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:58:06,110 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:58:06,111 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:58:06,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63d58f4c-1369-4133-a108-8da70e942182/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2023-11-26 11:58:09,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:58:09,405 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:58:09,406 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63d58f4c-1369-4133-a108-8da70e942182/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2023-11-26 11:58:09,416 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63d58f4c-1369-4133-a108-8da70e942182/bin/uautomizer-verify-VRDe98Ueme/data/fbfa52f2c/2b5848a39c174c589be0de37a2571db8/FLAGcc4e022c1 [2023-11-26 11:58:09,431 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63d58f4c-1369-4133-a108-8da70e942182/bin/uautomizer-verify-VRDe98Ueme/data/fbfa52f2c/2b5848a39c174c589be0de37a2571db8 [2023-11-26 11:58:09,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:58:09,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:58:09,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:58:09,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:58:09,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:58:09,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:09" (1/1) ... [2023-11-26 11:58:09,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c24cd01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:09, skipping insertion in model container [2023-11-26 11:58:09,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:09" (1/1) ... [2023-11-26 11:58:09,484 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:58:09,768 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:58:09,785 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:58:09,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:58:09,863 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:58:09,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:09 WrapperNode [2023-11-26 11:58:09,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:58:09,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:09,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:58:09,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:58:09,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:09" (1/1) ... [2023-11-26 11:58:09,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:09" (1/1) ... [2023-11-26 11:58:09,939 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 279 [2023-11-26 11:58:09,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:09,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:58:09,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:58:09,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:58:09,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:09" (1/1) ... [2023-11-26 11:58:09,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:09" (1/1) ... [2023-11-26 11:58:09,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:09" (1/1) ... [2023-11-26 11:58:09,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:09" (1/1) ... [2023-11-26 11:58:09,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:09" (1/1) ... [2023-11-26 11:58:09,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:09" (1/1) ... [2023-11-26 11:58:09,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:09" (1/1) ... [2023-11-26 11:58:09,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:09" (1/1) ... [2023-11-26 11:58:09,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:58:09,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:58:09,995 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:58:09,995 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:58:09,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:09" (1/1) ... [2023-11-26 11:58:10,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:58:10,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63d58f4c-1369-4133-a108-8da70e942182/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:58:10,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63d58f4c-1369-4133-a108-8da70e942182/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:58:10,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63d58f4c-1369-4133-a108-8da70e942182/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:58:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:58:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:58:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 11:58:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 11:58:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-26 11:58:10,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-26 11:58:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-26 11:58:10,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-26 11:58:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-26 11:58:10,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-26 11:58:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-26 11:58:10,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-26 11:58:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 11:58:10,079 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-11-26 11:58:10,079 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-11-26 11:58:10,079 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-11-26 11:58:10,079 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-11-26 11:58:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:58:10,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:58:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:58:10,082 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:58:10,217 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:58:10,219 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:58:10,916 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:58:10,949 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:58:10,950 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-26 11:58:10,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:10 BoogieIcfgContainer [2023-11-26 11:58:10,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:58:10,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:58:10,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:58:10,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:58:10,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:58:09" (1/3) ... [2023-11-26 11:58:10,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777bd1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:10, skipping insertion in model container [2023-11-26 11:58:10,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:09" (2/3) ... [2023-11-26 11:58:10,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777bd1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:10, skipping insertion in model container [2023-11-26 11:58:10,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:10" (3/3) ... [2023-11-26 11:58:10,964 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2023-11-26 11:58:10,974 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 11:58:10,986 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:58:10,986 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2023-11-26 11:58:10,987 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:58:11,184 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-11-26 11:58:11,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 470 places, 475 transitions, 992 flow [2023-11-26 11:58:11,486 INFO L124 PetriNetUnfolderBase]: 24/469 cut-off events. [2023-11-26 11:58:11,487 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-26 11:58:11,501 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-26 11:58:11,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 470 places, 475 transitions, 992 flow [2023-11-26 11:58:11,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 427 places, 430 transitions, 896 flow [2023-11-26 11:58:11,564 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:58:11,573 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;@7ea524a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:58:11,573 INFO L358 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2023-11-26 11:58:11,580 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:58:11,581 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2023-11-26 11:58:11,581 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:58:11,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:11,582 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-26 11:58:11,583 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-26 11:58:11,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:11,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1650698020, now seen corresponding path program 1 times [2023-11-26 11:58:11,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:11,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109795306] [2023-11-26 11:58:11,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:11,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:11,922 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-26 11:58:11,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:11,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109795306] [2023-11-26 11:58:11,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109795306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:11,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:11,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:11,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223798388] [2023-11-26 11:58:11,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:11,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:11,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:11,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:11,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:12,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-26 11:58:12,056 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-26 11:58:12,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:12,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-26 11:58:12,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:12,273 INFO L124 PetriNetUnfolderBase]: 40/557 cut-off events. [2023-11-26 11:58:12,274 INFO L125 PetriNetUnfolderBase]: For 46/48 co-relation queries the response was YES. [2023-11-26 11:58:12,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 557 events. 40/557 cut-off events. For 46/48 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-26 11:58:12,293 INFO L140 encePairwiseOnDemand]: 465/475 looper letters, 22 selfloop transitions, 2 changer transitions 1/422 dead transitions. [2023-11-26 11:58:12,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 422 transitions, 928 flow [2023-11-26 11:58:12,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-26 11:58:12,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-26 11:58:12,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-26 11:58:12,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-26 11:58:12,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:12,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-26 11:58:12,340 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-26 11:58:12,351 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-26 11:58:12,353 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-26 11:58:12,355 INFO L175 Difference]: Start difference. First operand has 427 places, 430 transitions, 896 flow. Second operand 3 states and 1352 transitions. [2023-11-26 11:58:12,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 422 transitions, 928 flow [2023-11-26 11:58:12,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 422 transitions, 904 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-11-26 11:58:12,380 INFO L231 Difference]: Finished difference. Result has 416 places, 421 transitions, 858 flow [2023-11-26 11:58:12,382 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-26 11:58:12,388 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -11 predicate places. [2023-11-26 11:58:12,389 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 421 transitions, 858 flow [2023-11-26 11:58:12,390 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-26 11:58:12,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:12,391 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-26 11:58:12,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:58:12,392 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-26 11:58:12,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:12,393 INFO L85 PathProgramCache]: Analyzing trace with hash 752302226, now seen corresponding path program 1 times [2023-11-26 11:58:12,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:12,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330593191] [2023-11-26 11:58:12,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:12,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:12,478 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-26 11:58:12,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:12,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330593191] [2023-11-26 11:58:12,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330593191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:12,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:12,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:12,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979570679] [2023-11-26 11:58:12,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:12,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:12,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:12,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:12,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:12,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-26 11:58:12,539 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-26 11:58:12,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:12,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-26 11:58:12,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:12,741 INFO L124 PetriNetUnfolderBase]: 40/555 cut-off events. [2023-11-26 11:58:12,741 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-26 11:58:12,748 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-26 11:58:12,756 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 22 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2023-11-26 11:58:12,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 420 transitions, 904 flow [2023-11-26 11:58:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-26 11:58:12,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-26 11:58:12,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-26 11:58:12,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-26 11:58:12,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:12,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-26 11:58:12,768 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-26 11:58:12,773 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-26 11:58:12,775 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-26 11:58:12,775 INFO L175 Difference]: Start difference. First operand has 416 places, 421 transitions, 858 flow. Second operand 3 states and 1345 transitions. [2023-11-26 11:58:12,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 420 transitions, 904 flow [2023-11-26 11:58:12,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 420 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:12,788 INFO L231 Difference]: Finished difference. Result has 414 places, 420 transitions, 856 flow [2023-11-26 11:58:12,789 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-26 11:58:12,790 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -13 predicate places. [2023-11-26 11:58:12,790 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 420 transitions, 856 flow [2023-11-26 11:58:12,791 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-26 11:58:12,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:12,792 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-26 11:58:12,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:58:12,792 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-26 11:58:12,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:12,793 INFO L85 PathProgramCache]: Analyzing trace with hash -453054482, now seen corresponding path program 1 times [2023-11-26 11:58:12,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:12,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850830035] [2023-11-26 11:58:12,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:12,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:12,857 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-26 11:58:12,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:12,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850830035] [2023-11-26 11:58:12,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850830035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:12,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:12,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:12,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535067575] [2023-11-26 11:58:12,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:12,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:12,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:12,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:12,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:12,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-26 11:58:12,916 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-26 11:58:12,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:12,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-26 11:58:12,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:13,131 INFO L124 PetriNetUnfolderBase]: 40/554 cut-off events. [2023-11-26 11:58:13,131 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-26 11:58:13,137 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-26 11:58:13,144 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 22 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2023-11-26 11:58:13,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 419 transitions, 902 flow [2023-11-26 11:58:13,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-26 11:58:13,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-26 11:58:13,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-26 11:58:13,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-26 11:58:13,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:13,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-26 11:58:13,156 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-26 11:58:13,160 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-26 11:58:13,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-26 11:58:13,162 INFO L175 Difference]: Start difference. First operand has 414 places, 420 transitions, 856 flow. Second operand 3 states and 1345 transitions. [2023-11-26 11:58:13,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 419 transitions, 902 flow [2023-11-26 11:58:13,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 419 transitions, 898 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:13,174 INFO L231 Difference]: Finished difference. Result has 413 places, 419 transitions, 854 flow [2023-11-26 11:58:13,175 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-26 11:58:13,176 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -14 predicate places. [2023-11-26 11:58:13,176 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 419 transitions, 854 flow [2023-11-26 11:58:13,177 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-26 11:58:13,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:13,178 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-26 11:58:13,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:58:13,178 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-26 11:58:13,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:13,179 INFO L85 PathProgramCache]: Analyzing trace with hash -222115273, now seen corresponding path program 1 times [2023-11-26 11:58:13,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:13,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744787785] [2023-11-26 11:58:13,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:13,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:13,236 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-26 11:58:13,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:13,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744787785] [2023-11-26 11:58:13,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744787785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:13,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:13,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:13,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880672305] [2023-11-26 11:58:13,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:13,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:13,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:13,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:13,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:13,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-26 11:58:13,291 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-26 11:58:13,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:13,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-26 11:58:13,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:13,454 INFO L124 PetriNetUnfolderBase]: 40/553 cut-off events. [2023-11-26 11:58:13,454 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-26 11:58:13,461 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-26 11:58:13,468 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 22 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2023-11-26 11:58:13,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 418 transitions, 900 flow [2023-11-26 11:58:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-26 11:58:13,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-26 11:58:13,473 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-26 11:58:13,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-26 11:58:13,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:13,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-26 11:58:13,479 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-26 11:58:13,483 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-26 11:58:13,485 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-26 11:58:13,485 INFO L175 Difference]: Start difference. First operand has 413 places, 419 transitions, 854 flow. Second operand 3 states and 1345 transitions. [2023-11-26 11:58:13,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 418 transitions, 900 flow [2023-11-26 11:58:13,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 418 transitions, 896 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:13,497 INFO L231 Difference]: Finished difference. Result has 412 places, 418 transitions, 852 flow [2023-11-26 11:58:13,498 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-26 11:58:13,499 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -15 predicate places. [2023-11-26 11:58:13,499 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 418 transitions, 852 flow [2023-11-26 11:58:13,500 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-26 11:58:13,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:13,501 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-26 11:58:13,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:58:13,501 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-26 11:58:13,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:13,501 INFO L85 PathProgramCache]: Analyzing trace with hash 406414307, now seen corresponding path program 1 times [2023-11-26 11:58:13,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:13,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3079237] [2023-11-26 11:58:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:13,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:13,555 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-26 11:58:13,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:13,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3079237] [2023-11-26 11:58:13,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3079237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:13,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:13,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:13,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525830364] [2023-11-26 11:58:13,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:13,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:13,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:13,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:13,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:13,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-26 11:58:13,624 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-26 11:58:13,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:13,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-26 11:58:13,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:13,804 INFO L124 PetriNetUnfolderBase]: 40/552 cut-off events. [2023-11-26 11:58:13,804 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-26 11:58:13,811 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-26 11:58:13,819 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 22 selfloop transitions, 2 changer transitions 0/417 dead transitions. [2023-11-26 11:58:13,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 417 transitions, 898 flow [2023-11-26 11:58:13,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-26 11:58:13,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-26 11:58:13,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-26 11:58:13,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-26 11:58:13,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:13,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-26 11:58:13,833 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-26 11:58:13,838 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-26 11:58:13,840 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-26 11:58:13,840 INFO L175 Difference]: Start difference. First operand has 412 places, 418 transitions, 852 flow. Second operand 3 states and 1345 transitions. [2023-11-26 11:58:13,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 417 transitions, 898 flow [2023-11-26 11:58:13,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 417 transitions, 894 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:13,853 INFO L231 Difference]: Finished difference. Result has 411 places, 417 transitions, 850 flow [2023-11-26 11:58:13,854 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-26 11:58:13,855 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -16 predicate places. [2023-11-26 11:58:13,855 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 417 transitions, 850 flow [2023-11-26 11:58:13,857 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-26 11:58:13,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:13,857 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-26 11:58:13,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:58:13,858 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-26 11:58:13,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash 302023988, now seen corresponding path program 1 times [2023-11-26 11:58:13,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:13,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247372839] [2023-11-26 11:58:13,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:13,914 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-26 11:58:13,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:13,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247372839] [2023-11-26 11:58:13,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247372839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:13,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:13,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670159869] [2023-11-26 11:58:13,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:13,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:13,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:13,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:13,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-26 11:58:13,969 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-26 11:58:13,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:13,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-26 11:58:13,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:14,119 INFO L124 PetriNetUnfolderBase]: 40/551 cut-off events. [2023-11-26 11:58:14,119 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-26 11:58:14,125 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-26 11:58:14,131 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 22 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2023-11-26 11:58:14,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 416 transitions, 896 flow [2023-11-26 11:58:14,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-26 11:58:14,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-26 11:58:14,137 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-26 11:58:14,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-26 11:58:14,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:14,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-26 11:58:14,143 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-26 11:58:14,147 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-26 11:58:14,149 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-26 11:58:14,149 INFO L175 Difference]: Start difference. First operand has 411 places, 417 transitions, 850 flow. Second operand 3 states and 1345 transitions. [2023-11-26 11:58:14,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 416 transitions, 896 flow [2023-11-26 11:58:14,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 416 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:14,160 INFO L231 Difference]: Finished difference. Result has 410 places, 416 transitions, 848 flow [2023-11-26 11:58:14,161 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-26 11:58:14,162 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -17 predicate places. [2023-11-26 11:58:14,162 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 416 transitions, 848 flow [2023-11-26 11:58:14,164 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-26 11:58:14,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:14,164 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-26 11:58:14,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:58:14,165 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-26 11:58:14,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:14,165 INFO L85 PathProgramCache]: Analyzing trace with hash -497961939, now seen corresponding path program 1 times [2023-11-26 11:58:14,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:14,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132607145] [2023-11-26 11:58:14,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:14,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:14,219 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-26 11:58:14,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:14,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132607145] [2023-11-26 11:58:14,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132607145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:14,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:14,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:14,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399115495] [2023-11-26 11:58:14,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:14,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:14,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:14,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:14,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:14,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 475 [2023-11-26 11:58:14,300 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-26 11:58:14,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:14,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 475 [2023-11-26 11:58:14,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:15,587 INFO L124 PetriNetUnfolderBase]: 758/4855 cut-off events. [2023-11-26 11:58:15,587 INFO L125 PetriNetUnfolderBase]: For 63/80 co-relation queries the response was YES. [2023-11-26 11:58:15,649 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-26 11:58:15,726 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 27 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2023-11-26 11:58:15,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 415 transitions, 904 flow [2023-11-26 11:58:15,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1335 transitions. [2023-11-26 11:58:15,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9368421052631579 [2023-11-26 11:58:15,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1335 transitions. [2023-11-26 11:58:15,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1335 transitions. [2023-11-26 11:58:15,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:15,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1335 transitions. [2023-11-26 11:58:15,742 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-26 11:58:15,746 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-26 11:58:15,748 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-26 11:58:15,749 INFO L175 Difference]: Start difference. First operand has 410 places, 416 transitions, 848 flow. Second operand 3 states and 1335 transitions. [2023-11-26 11:58:15,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 415 transitions, 904 flow [2023-11-26 11:58:15,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 415 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:15,763 INFO L231 Difference]: Finished difference. Result has 409 places, 415 transitions, 846 flow [2023-11-26 11:58:15,764 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-26 11:58:15,765 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -18 predicate places. [2023-11-26 11:58:15,765 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 415 transitions, 846 flow [2023-11-26 11:58:15,766 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-26 11:58:15,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:15,766 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-26 11:58:15,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:58:15,767 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-26 11:58:15,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:15,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1051112528, now seen corresponding path program 1 times [2023-11-26 11:58:15,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:15,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219188634] [2023-11-26 11:58:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:15,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:15,828 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-26 11:58:15,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:15,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219188634] [2023-11-26 11:58:15,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219188634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:15,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:15,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:15,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538290539] [2023-11-26 11:58:15,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:15,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:15,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:15,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:15,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:15,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-26 11:58:15,866 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-26 11:58:15,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:15,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-26 11:58:15,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:16,029 INFO L124 PetriNetUnfolderBase]: 55/545 cut-off events. [2023-11-26 11:58:16,030 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2023-11-26 11:58:16,036 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-26 11:58:16,042 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 29 selfloop transitions, 3 changer transitions 0/415 dead transitions. [2023-11-26 11:58:16,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 415 transitions, 915 flow [2023-11-26 11:58:16,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1340 transitions. [2023-11-26 11:58:16,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9403508771929825 [2023-11-26 11:58:16,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1340 transitions. [2023-11-26 11:58:16,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1340 transitions. [2023-11-26 11:58:16,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:16,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1340 transitions. [2023-11-26 11:58:16,053 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-26 11:58:16,057 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-26 11:58:16,108 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-26 11:58:16,108 INFO L175 Difference]: Start difference. First operand has 409 places, 415 transitions, 846 flow. Second operand 3 states and 1340 transitions. [2023-11-26 11:58:16,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 415 transitions, 915 flow [2023-11-26 11:58:16,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 415 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:16,119 INFO L231 Difference]: Finished difference. Result has 404 places, 410 transitions, 843 flow [2023-11-26 11:58:16,120 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-26 11:58:16,121 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -23 predicate places. [2023-11-26 11:58:16,121 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 410 transitions, 843 flow [2023-11-26 11:58:16,122 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-26 11:58:16,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:16,122 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-26 11:58:16,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:58:16,123 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-26 11:58:16,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:16,123 INFO L85 PathProgramCache]: Analyzing trace with hash 801853608, now seen corresponding path program 1 times [2023-11-26 11:58:16,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:16,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361156243] [2023-11-26 11:58:16,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:16,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:16,222 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-26 11:58:16,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:16,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361156243] [2023-11-26 11:58:16,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361156243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:16,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:16,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:16,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619561711] [2023-11-26 11:58:16,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:16,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:16,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:16,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:16,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:16,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-26 11:58:16,269 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-26 11:58:16,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:16,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-26 11:58:16,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:16,438 INFO L124 PetriNetUnfolderBase]: 55/540 cut-off events. [2023-11-26 11:58:16,438 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-26 11:58:16,446 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-26 11:58:16,451 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 29 selfloop transitions, 3 changer transitions 0/410 dead transitions. [2023-11-26 11:58:16,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 410 transitions, 912 flow [2023-11-26 11:58:16,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1340 transitions. [2023-11-26 11:58:16,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9403508771929825 [2023-11-26 11:58:16,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1340 transitions. [2023-11-26 11:58:16,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1340 transitions. [2023-11-26 11:58:16,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:16,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1340 transitions. [2023-11-26 11:58:16,463 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-26 11:58:16,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-26 11:58:16,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-26 11:58:16,469 INFO L175 Difference]: Start difference. First operand has 404 places, 410 transitions, 843 flow. Second operand 3 states and 1340 transitions. [2023-11-26 11:58:16,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 410 transitions, 912 flow [2023-11-26 11:58:16,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 410 transitions, 909 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:58:16,482 INFO L231 Difference]: Finished difference. Result has 400 places, 405 transitions, 841 flow [2023-11-26 11:58:16,483 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-26 11:58:16,484 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -27 predicate places. [2023-11-26 11:58:16,484 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 405 transitions, 841 flow [2023-11-26 11:58:16,485 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-26 11:58:16,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:16,486 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-26 11:58:16,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:58:16,486 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-26 11:58:16,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:16,487 INFO L85 PathProgramCache]: Analyzing trace with hash -999268320, now seen corresponding path program 1 times [2023-11-26 11:58:16,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:16,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630923370] [2023-11-26 11:58:16,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:16,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:16,579 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-26 11:58:16,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:16,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630923370] [2023-11-26 11:58:16,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630923370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:16,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:16,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:16,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678563507] [2023-11-26 11:58:16,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:16,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:16,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:16,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:16,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:16,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-26 11:58:16,616 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-26 11:58:16,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:16,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-26 11:58:16,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:16,897 INFO L124 PetriNetUnfolderBase]: 71/899 cut-off events. [2023-11-26 11:58:16,898 INFO L125 PetriNetUnfolderBase]: For 24/28 co-relation queries the response was YES. [2023-11-26 11:58:16,913 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-26 11:58:16,922 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 32 selfloop transitions, 3 changer transitions 0/408 dead transitions. [2023-11-26 11:58:16,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 408 transitions, 925 flow [2023-11-26 11:58:16,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1343 transitions. [2023-11-26 11:58:16,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9424561403508772 [2023-11-26 11:58:16,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1343 transitions. [2023-11-26 11:58:16,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1343 transitions. [2023-11-26 11:58:16,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:16,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1343 transitions. [2023-11-26 11:58:16,934 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-26 11:58:16,938 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-26 11:58:16,940 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-26 11:58:16,940 INFO L175 Difference]: Start difference. First operand has 400 places, 405 transitions, 841 flow. Second operand 3 states and 1343 transitions. [2023-11-26 11:58:16,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 408 transitions, 925 flow [2023-11-26 11:58:16,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 408 transitions, 922 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:58:16,953 INFO L231 Difference]: Finished difference. Result has 396 places, 400 transitions, 839 flow [2023-11-26 11:58:16,954 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-26 11:58:16,957 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -31 predicate places. [2023-11-26 11:58:16,957 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 400 transitions, 839 flow [2023-11-26 11:58:16,958 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-26 11:58:16,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:16,959 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-26 11:58:16,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:58:16,959 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-26 11:58:16,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:16,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1771337507, now seen corresponding path program 1 times [2023-11-26 11:58:16,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:16,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461072562] [2023-11-26 11:58:16,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:16,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:17,025 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-26 11:58:17,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:17,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461072562] [2023-11-26 11:58:17,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461072562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:17,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:17,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:17,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780402180] [2023-11-26 11:58:17,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:17,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:17,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:17,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:17,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:17,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-26 11:58:17,061 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-26 11:58:17,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:17,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-26 11:58:17,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:17,409 INFO L124 PetriNetUnfolderBase]: 103/1163 cut-off events. [2023-11-26 11:58:17,409 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-11-26 11:58:17,425 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-26 11:58:17,434 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 34 selfloop transitions, 3 changer transitions 0/405 dead transitions. [2023-11-26 11:58:17,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 405 transitions, 933 flow [2023-11-26 11:58:17,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-26 11:58:17,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-26 11:58:17,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-26 11:58:17,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-26 11:58:17,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:17,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-26 11:58:17,445 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-26 11:58:17,449 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-26 11:58:17,449 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-26 11:58:17,450 INFO L175 Difference]: Start difference. First operand has 396 places, 400 transitions, 839 flow. Second operand 3 states and 1345 transitions. [2023-11-26 11:58:17,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 405 transitions, 933 flow [2023-11-26 11:58:17,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 405 transitions, 930 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:58:17,461 INFO L231 Difference]: Finished difference. Result has 392 places, 395 transitions, 837 flow [2023-11-26 11:58:17,462 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-26 11:58:17,464 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -35 predicate places. [2023-11-26 11:58:17,464 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 395 transitions, 837 flow [2023-11-26 11:58:17,465 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-26 11:58:17,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:17,465 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-26 11:58:17,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:58:17,466 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-26 11:58:17,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:17,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1775846873, now seen corresponding path program 1 times [2023-11-26 11:58:17,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:17,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998721274] [2023-11-26 11:58:17,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:17,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:17,529 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-26 11:58:17,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:17,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998721274] [2023-11-26 11:58:17,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998721274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:17,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:17,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131362336] [2023-11-26 11:58:17,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:17,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:17,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:17,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:17,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:17,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-26 11:58:17,565 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-26 11:58:17,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:17,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-26 11:58:17,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:18,169 INFO L124 PetriNetUnfolderBase]: 199/1794 cut-off events. [2023-11-26 11:58:18,170 INFO L125 PetriNetUnfolderBase]: For 103/111 co-relation queries the response was YES. [2023-11-26 11:58:18,204 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-26 11:58:18,225 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 33 selfloop transitions, 3 changer transitions 0/399 dead transitions. [2023-11-26 11:58:18,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 399 transitions, 926 flow [2023-11-26 11:58:18,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1344 transitions. [2023-11-26 11:58:18,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9431578947368421 [2023-11-26 11:58:18,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1344 transitions. [2023-11-26 11:58:18,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1344 transitions. [2023-11-26 11:58:18,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:18,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1344 transitions. [2023-11-26 11:58:18,239 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-26 11:58:18,244 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-26 11:58:18,245 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-26 11:58:18,245 INFO L175 Difference]: Start difference. First operand has 392 places, 395 transitions, 837 flow. Second operand 3 states and 1344 transitions. [2023-11-26 11:58:18,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 399 transitions, 926 flow [2023-11-26 11:58:18,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 399 transitions, 923 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:58:18,261 INFO L231 Difference]: Finished difference. Result has 388 places, 390 transitions, 835 flow [2023-11-26 11:58:18,262 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-26 11:58:18,265 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -39 predicate places. [2023-11-26 11:58:18,265 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 390 transitions, 835 flow [2023-11-26 11:58:18,266 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-26 11:58:18,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:18,266 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-26 11:58:18,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:58:18,267 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-26 11:58:18,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1448319996, now seen corresponding path program 1 times [2023-11-26 11:58:18,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:18,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869792135] [2023-11-26 11:58:18,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:18,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:18,328 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-26 11:58:18,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:18,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869792135] [2023-11-26 11:58:18,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869792135] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:18,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:18,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:18,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637724523] [2023-11-26 11:58:18,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:18,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:18,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:18,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:18,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:18,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-26 11:58:18,370 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-26 11:58:18,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:18,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-26 11:58:18,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:18,933 INFO L124 PetriNetUnfolderBase]: 175/1479 cut-off events. [2023-11-26 11:58:18,934 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2023-11-26 11:58:18,956 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-26 11:58:18,967 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 33 selfloop transitions, 3 changer transitions 8/396 dead transitions. [2023-11-26 11:58:18,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 396 transitions, 932 flow [2023-11-26 11:58:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-26 11:58:18,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-26 11:58:18,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-26 11:58:18,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-26 11:58:18,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:18,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-26 11:58:18,980 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-26 11:58:18,983 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-26 11:58:18,984 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-26 11:58:18,985 INFO L175 Difference]: Start difference. First operand has 388 places, 390 transitions, 835 flow. Second operand 3 states and 1345 transitions. [2023-11-26 11:58:18,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 396 transitions, 932 flow [2023-11-26 11:58:18,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 396 transitions, 929 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:58:18,996 INFO L231 Difference]: Finished difference. Result has 384 places, 377 transitions, 817 flow [2023-11-26 11:58:18,998 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-26 11:58:18,999 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -43 predicate places. [2023-11-26 11:58:18,999 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 377 transitions, 817 flow [2023-11-26 11:58:19,001 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-26 11:58:19,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:19,002 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-26 11:58:19,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:58:19,003 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-26 11:58:19,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1239713763, now seen corresponding path program 1 times [2023-11-26 11:58:19,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:19,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556238240] [2023-11-26 11:58:19,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:19,060 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-26 11:58:19,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:19,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556238240] [2023-11-26 11:58:19,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556238240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:19,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:19,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:19,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28752009] [2023-11-26 11:58:19,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:19,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:19,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:19,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:19,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:19,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 475 [2023-11-26 11:58:19,112 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-26 11:58:19,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:19,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 475 [2023-11-26 11:58:19,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:31,449 INFO L124 PetriNetUnfolderBase]: 17906/61411 cut-off events. [2023-11-26 11:58:31,449 INFO L125 PetriNetUnfolderBase]: For 1608/1813 co-relation queries the response was YES. [2023-11-26 11:58:32,034 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-26 11:58:32,870 INFO L140 encePairwiseOnDemand]: 457/475 looper letters, 29 selfloop transitions, 6 changer transitions 59/376 dead transitions. [2023-11-26 11:58:32,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 376 transitions, 914 flow [2023-11-26 11:58:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1310 transitions. [2023-11-26 11:58:32,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9192982456140351 [2023-11-26 11:58:32,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1310 transitions. [2023-11-26 11:58:32,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1310 transitions. [2023-11-26 11:58:32,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:32,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1310 transitions. [2023-11-26 11:58:32,882 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-26 11:58:32,886 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-26 11:58:32,887 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-26 11:58:32,887 INFO L175 Difference]: Start difference. First operand has 384 places, 377 transitions, 817 flow. Second operand 3 states and 1310 transitions. [2023-11-26 11:58:32,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 376 transitions, 914 flow [2023-11-26 11:58:33,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 376 transitions, 911 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:58:33,159 INFO L231 Difference]: Finished difference. Result has 367 places, 312 transitions, 713 flow [2023-11-26 11:58:33,160 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-26 11:58:33,161 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -60 predicate places. [2023-11-26 11:58:33,161 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 312 transitions, 713 flow [2023-11-26 11:58:33,162 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-26 11:58:33,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:33,163 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-26 11:58:33,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:58:33,163 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-26 11:58:33,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:33,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1156405926, now seen corresponding path program 1 times [2023-11-26 11:58:33,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:33,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754376731] [2023-11-26 11:58:33,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:33,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:33,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:33,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:33,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754376731] [2023-11-26 11:58:33,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754376731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:33,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:33,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:33,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448543535] [2023-11-26 11:58:33,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:33,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:33,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:33,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:33,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:33,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-26 11:58:33,276 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-26 11:58:33,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:33,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-26 11:58:33,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:34,900 INFO L124 PetriNetUnfolderBase]: 1604/7610 cut-off events. [2023-11-26 11:58:34,900 INFO L125 PetriNetUnfolderBase]: For 41/49 co-relation queries the response was YES. [2023-11-26 11:58:35,044 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-26 11:58:35,117 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/316 dead transitions. [2023-11-26 11:58:35,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 316 transitions, 778 flow [2023-11-26 11:58:35,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-26 11:58:35,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-26 11:58:35,122 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-26 11:58:35,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-26 11:58:35,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:35,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-26 11:58:35,127 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-26 11:58:35,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-26 11:58:35,131 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-26 11:58:35,132 INFO L175 Difference]: Start difference. First operand has 367 places, 312 transitions, 713 flow. Second operand 3 states and 1352 transitions. [2023-11-26 11:58:35,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 316 transitions, 778 flow [2023-11-26 11:58:35,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 316 transitions, 778 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:58:35,143 INFO L231 Difference]: Finished difference. Result has 315 places, 311 transitions, 715 flow [2023-11-26 11:58:35,144 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-26 11:58:35,145 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -112 predicate places. [2023-11-26 11:58:35,145 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 311 transitions, 715 flow [2023-11-26 11:58:35,146 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-26 11:58:35,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:35,146 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-26 11:58:35,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:58:35,147 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-26 11:58:35,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:35,147 INFO L85 PathProgramCache]: Analyzing trace with hash 702577034, now seen corresponding path program 1 times [2023-11-26 11:58:35,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:35,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783147326] [2023-11-26 11:58:35,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:35,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:35,203 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-26 11:58:35,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:35,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783147326] [2023-11-26 11:58:35,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783147326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:35,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:35,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:35,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621706651] [2023-11-26 11:58:35,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:35,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:35,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:35,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:35,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:35,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-26 11:58:35,253 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-26 11:58:35,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:35,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-26 11:58:35,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:38,108 INFO L124 PetriNetUnfolderBase]: 2799/13425 cut-off events. [2023-11-26 11:58:38,108 INFO L125 PetriNetUnfolderBase]: For 253/257 co-relation queries the response was YES. [2023-11-26 11:58:38,331 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-26 11:58:38,455 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2023-11-26 11:58:38,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 315 transitions, 780 flow [2023-11-26 11:58:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:38,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-26 11:58:38,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-26 11:58:38,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-26 11:58:38,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-26 11:58:38,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:38,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-26 11:58:38,467 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-26 11:58:38,470 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-26 11:58:38,471 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-26 11:58:38,471 INFO L175 Difference]: Start difference. First operand has 315 places, 311 transitions, 715 flow. Second operand 3 states and 1352 transitions. [2023-11-26 11:58:38,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 315 transitions, 780 flow [2023-11-26 11:58:38,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 315 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:38,485 INFO L231 Difference]: Finished difference. Result has 314 places, 310 transitions, 713 flow [2023-11-26 11:58:38,486 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-26 11:58:38,487 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -113 predicate places. [2023-11-26 11:58:38,487 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 310 transitions, 713 flow [2023-11-26 11:58:38,487 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-26 11:58:38,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:38,488 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-26 11:58:38,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:58:38,488 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-26 11:58:38,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:38,489 INFO L85 PathProgramCache]: Analyzing trace with hash -110040722, now seen corresponding path program 1 times [2023-11-26 11:58:38,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:38,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602688517] [2023-11-26 11:58:38,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:38,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:38,543 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-26 11:58:38,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:38,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602688517] [2023-11-26 11:58:38,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602688517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:38,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:38,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:38,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495209683] [2023-11-26 11:58:38,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:38,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:38,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:38,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:38,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:38,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-26 11:58:38,589 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-26 11:58:38,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:38,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-26 11:58:38,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:39,673 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-26 11:58:39,673 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-26 11:58:39,673 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:58:39,673 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 11:58:39,673 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-26 11:58:39,674 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-26 11:58:39,674 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-26 11:58:39,674 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 11:58:39,674 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-26 11:58:39,674 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-26 11:58:39,684 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-26 11:58:39,684 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-26 11:58:39,684 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-26 11:58:39,685 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:58:39,685 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 11:58:39,686 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-26 11:58:39,686 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-26 11:58:39,686 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 11:58:39,686 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-26 11:58:39,687 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-26 11:58:39,965 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-26 11:58:39,966 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-26 11:58:39,966 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 11:58:39,966 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-26 11:58:39,966 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-26 11:58:39,967 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-26 11:58:39,967 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-26 11:58:39,967 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 11:58:39,968 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 11:58:39,968 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-26 11:58:40,088 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-26 11:58:40,089 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-26 11:58:40,089 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-26 11:58:40,089 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:40,089 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:58:40,090 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-26 11:58:40,090 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-26 11:58:40,091 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:58:40,091 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-26 11:58:40,091 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-26 11:58:40,099 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-26 11:58:40,099 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-26 11:58:40,099 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:40,100 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:58:40,100 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-26 11:58:40,100 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-26 11:58:40,100 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-26 11:58:40,100 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:58:40,100 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-26 11:58:40,101 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-26 11:58:40,144 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-26 11:58:40,145 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-26 11:58:40,145 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 11:58:40,145 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-26 11:58:40,145 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:58:40,145 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-26 11:58:40,145 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-26 11:58:40,145 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:58:40,146 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 11:58:40,146 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:58:40,147 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-26 11:58:40,147 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-26 11:58:40,147 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:58:40,148 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 11:58:40,148 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:58:40,159 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-26 11:58:40,159 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-26 11:58:40,159 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-26 11:58:40,160 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 11:58:40,160 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:58:40,160 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-26 11:58:40,160 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-26 11:58:40,160 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:58:40,161 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:58:40,161 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 11:58:40,162 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-26 11:58:40,162 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-26 11:58:40,162 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:58:40,162 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:58:40,162 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 11:58:40,580 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-26 11:58:40,580 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-26 11:58:40,580 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:58:40,580 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 11:58:40,581 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:58:40,584 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-26 11:58:40,584 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-26 11:58:40,584 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-26 11:58:40,584 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-26 11:58:40,584 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:58:40,586 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-26 11:58:40,586 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-26 11:58:40,586 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-26 11:58:40,586 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 11:58:40,586 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 11:58:40,624 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-26 11:58:40,624 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-26 11:58:40,624 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:58:40,624 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:58:40,624 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 11:58:40,624 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-26 11:58:40,625 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-26 11:58:40,625 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:40,625 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:58:40,625 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:40,626 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-26 11:58:40,626 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-26 11:58:40,626 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:40,626 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:58:40,626 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:40,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], [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-26 11:58:40,706 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-26 11:58:40,706 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:58:40,706 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-26 11:58:40,706 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:58:40,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], [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-26 11:58:40,706 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-26 11:58:40,707 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 11:58:40,707 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-26 11:58:40,707 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-26 11:58:40,708 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-26 11:58:40,708 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-26 11:58:40,708 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-26 11:58:40,708 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:58:40,708 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:58:40,715 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-26 11:58:40,715 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-26 11:58:40,715 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:58:40,715 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-26 11:58:40,715 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:58:40,716 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-26 11:58:40,716 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-26 11:58:40,716 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-26 11:58:40,716 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-26 11:58:40,716 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 11:58:40,717 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-26 11:58:40,717 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-26 11:58:40,718 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:58:40,718 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-26 11:58:40,718 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:58:40,835 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-26 11:58:40,835 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-26 11:58:40,835 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:40,836 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:40,836 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:58:40,840 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-26 11:58:40,840 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-26 11:58:40,840 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:40,840 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:58:40,840 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:40,965 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-26 11:58:40,965 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-26 11:58:40,965 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:40,965 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:58:40,965 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 11:58:40,966 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-26 11:58:40,966 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-26 11:58:40,966 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-26 11:58:40,966 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:58:40,966 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:58:40,967 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-26 11:58:40,967 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-26 11:58:40,967 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:58:40,968 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:40,968 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 11:58:41,061 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-26 11:58:41,061 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-26 11:58:41,061 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:58:41,061 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-26 11:58:41,061 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 11:58:41,857 INFO L124 PetriNetUnfolderBase]: 2898/13264 cut-off events. [2023-11-26 11:58:41,857 INFO L125 PetriNetUnfolderBase]: For 486/514 co-relation queries the response was YES. [2023-11-26 11:58:42,042 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-26 11:58:42,132 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2023-11-26 11:58:42,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 314 transitions, 778 flow [2023-11-26 11:58:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-26 11:58:42,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-26 11:58:42,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-26 11:58:42,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-26 11:58:42,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:42,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-26 11:58:42,145 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-26 11:58:42,149 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-26 11:58:42,150 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-26 11:58:42,150 INFO L175 Difference]: Start difference. First operand has 314 places, 310 transitions, 713 flow. Second operand 3 states and 1352 transitions. [2023-11-26 11:58:42,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 314 transitions, 778 flow [2023-11-26 11:58:42,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 314 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:42,168 INFO L231 Difference]: Finished difference. Result has 313 places, 309 transitions, 711 flow [2023-11-26 11:58:42,169 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-26 11:58:42,169 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -114 predicate places. [2023-11-26 11:58:42,170 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 309 transitions, 711 flow [2023-11-26 11:58:42,170 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-26 11:58:42,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:42,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:42,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:58:42,171 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-26 11:58:42,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:42,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1054394131, now seen corresponding path program 1 times [2023-11-26 11:58:42,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:42,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42842861] [2023-11-26 11:58:42,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:42,248 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-26 11:58:42,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:42,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42842861] [2023-11-26 11:58:42,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42842861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:42,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:42,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:42,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591830905] [2023-11-26 11:58:42,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:42,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:42,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:42,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:42,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:42,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-26 11:58:42,295 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-26 11:58:42,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:42,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-26 11:58:42,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:43,999 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-26 11:58:43,999 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-26 11:58:43,999 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:58:43,999 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:58:43,999 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 11:58:44,000 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-26 11:58:44,000 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-26 11:58:44,000 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:44,000 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:58:44,000 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:44,004 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-26 11:58:44,005 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-26 11:58:44,005 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:58:44,005 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:58:44,005 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 11:58:44,005 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-26 11:58:44,006 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-26 11:58:44,006 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:44,006 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:44,006 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:58:44,160 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-26 11:58:44,160 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-26 11:58:44,160 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:44,160 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:44,160 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:58:44,161 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-26 11:58:44,161 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-26 11:58:44,161 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 11:58:44,161 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-26 11:58:44,161 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:58:44,190 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-26 11:58:44,190 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-26 11:58:44,190 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:58:44,190 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-26 11:58:44,190 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:58:44,191 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-26 11:58:44,192 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-26 11:58:44,192 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:58:44,192 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-26 11:58:44,192 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:58:44,314 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-26 11:58:44,315 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-26 11:58:44,315 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:58:44,315 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 11:58:44,315 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:44,836 INFO L124 PetriNetUnfolderBase]: 2506/11352 cut-off events. [2023-11-26 11:58:44,837 INFO L125 PetriNetUnfolderBase]: For 646/686 co-relation queries the response was YES. [2023-11-26 11:58:45,032 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-26 11:58:45,106 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2023-11-26 11:58:45,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 313 transitions, 776 flow [2023-11-26 11:58:45,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-26 11:58:45,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-26 11:58:45,112 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-26 11:58:45,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-26 11:58:45,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:45,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-26 11:58:45,118 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-26 11:58:45,122 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-26 11:58:45,123 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-26 11:58:45,123 INFO L175 Difference]: Start difference. First operand has 313 places, 309 transitions, 711 flow. Second operand 3 states and 1352 transitions. [2023-11-26 11:58:45,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 313 transitions, 776 flow [2023-11-26 11:58:45,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 313 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:45,455 INFO L231 Difference]: Finished difference. Result has 312 places, 308 transitions, 709 flow [2023-11-26 11:58:45,456 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-26 11:58:45,456 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -115 predicate places. [2023-11-26 11:58:45,456 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 308 transitions, 709 flow [2023-11-26 11:58:45,457 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-26 11:58:45,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:45,457 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-26 11:58:45,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 11:58:45,457 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-26 11:58:45,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash 58412032, now seen corresponding path program 1 times [2023-11-26 11:58:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:45,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413724307] [2023-11-26 11:58:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:46,280 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-26 11:58:46,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:46,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413724307] [2023-11-26 11:58:46,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413724307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:46,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:46,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:58:46,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533758891] [2023-11-26 11:58:46,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:46,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:58:46,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:46,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:58:46,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:58:46,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 475 [2023-11-26 11:58:46,677 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-26 11:58:46,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:46,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 475 [2023-11-26 11:58:46,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:47,887 INFO L124 PetriNetUnfolderBase]: 984/5101 cut-off events. [2023-11-26 11:58:47,888 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-11-26 11:58:47,935 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-26 11:58:47,959 INFO L140 encePairwiseOnDemand]: 470/475 looper letters, 14 selfloop transitions, 4 changer transitions 0/307 dead transitions. [2023-11-26 11:58:47,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 307 transitions, 743 flow [2023-11-26 11:58:47,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:58:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:58:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2683 transitions. [2023-11-26 11:58:47,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9414035087719298 [2023-11-26 11:58:47,969 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2683 transitions. [2023-11-26 11:58:47,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2683 transitions. [2023-11-26 11:58:47,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:47,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2683 transitions. [2023-11-26 11:58:47,980 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-26 11:58:47,987 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-26 11:58:47,988 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-26 11:58:47,988 INFO L175 Difference]: Start difference. First operand has 312 places, 308 transitions, 709 flow. Second operand 6 states and 2683 transitions. [2023-11-26 11:58:47,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 307 transitions, 743 flow [2023-11-26 11:58:47,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 307 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:47,999 INFO L231 Difference]: Finished difference. Result has 314 places, 307 transitions, 711 flow [2023-11-26 11:58:47,999 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-26 11:58:48,000 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -113 predicate places. [2023-11-26 11:58:48,000 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 307 transitions, 711 flow [2023-11-26 11:58:48,001 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-26 11:58:48,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:48,002 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-26 11:58:48,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 11:58:48,002 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-26 11:58:48,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:48,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1550933510, now seen corresponding path program 1 times [2023-11-26 11:58:48,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:48,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735268771] [2023-11-26 11:58:48,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:48,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:48,067 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-26 11:58:48,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:48,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735268771] [2023-11-26 11:58:48,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735268771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:48,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:48,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:48,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832644535] [2023-11-26 11:58:48,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:48,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:48,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:48,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:48,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:48,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-26 11:58:48,111 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-26 11:58:48,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:48,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-26 11:58:48,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:50,666 INFO L124 PetriNetUnfolderBase]: 2008/9178 cut-off events. [2023-11-26 11:58:50,667 INFO L125 PetriNetUnfolderBase]: For 496/526 co-relation queries the response was YES. [2023-11-26 11:58:50,800 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-26 11:58:50,861 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2023-11-26 11:58:50,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 311 transitions, 776 flow [2023-11-26 11:58:50,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-26 11:58:50,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-26 11:58:50,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-26 11:58:50,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-26 11:58:50,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:50,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-26 11:58:50,874 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-26 11:58:50,879 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-26 11:58:50,880 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-26 11:58:50,880 INFO L175 Difference]: Start difference. First operand has 314 places, 307 transitions, 711 flow. Second operand 3 states and 1352 transitions. [2023-11-26 11:58:50,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 311 transitions, 776 flow [2023-11-26 11:58:50,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 311 transitions, 769 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 11:58:50,894 INFO L231 Difference]: Finished difference. Result has 311 places, 306 transitions, 706 flow [2023-11-26 11:58:50,895 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-26 11:58:50,896 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -116 predicate places. [2023-11-26 11:58:50,896 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 306 transitions, 706 flow [2023-11-26 11:58:50,896 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-26 11:58:50,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:50,897 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-26 11:58:50,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 11:58:50,897 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-26 11:58:50,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1639015021, now seen corresponding path program 1 times [2023-11-26 11:58:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:50,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199376252] [2023-11-26 11:58:50,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:50,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:50,976 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-26 11:58:50,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:50,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199376252] [2023-11-26 11:58:50,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199376252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:50,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:50,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:50,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375647588] [2023-11-26 11:58:50,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:50,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:50,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:50,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:50,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:51,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-26 11:58:51,020 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-26 11:58:51,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:51,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-26 11:58:51,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:52,356 INFO L124 PetriNetUnfolderBase]: 1480/6778 cut-off events. [2023-11-26 11:58:52,357 INFO L125 PetriNetUnfolderBase]: For 360/384 co-relation queries the response was YES. [2023-11-26 11:58:52,455 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-26 11:58:52,495 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2023-11-26 11:58:52,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 310 transitions, 771 flow [2023-11-26 11:58:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-26 11:58:52,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-26 11:58:52,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-26 11:58:52,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-26 11:58:52,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:52,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-26 11:58:52,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-26 11:58:52,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-26 11:58:52,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-26 11:58:52,512 INFO L175 Difference]: Start difference. First operand has 311 places, 306 transitions, 706 flow. Second operand 3 states and 1352 transitions. [2023-11-26 11:58:52,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 310 transitions, 771 flow [2023-11-26 11:58:52,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 310 transitions, 767 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:52,527 INFO L231 Difference]: Finished difference. Result has 310 places, 305 transitions, 704 flow [2023-11-26 11:58:52,527 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-26 11:58:52,528 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -117 predicate places. [2023-11-26 11:58:52,528 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 305 transitions, 704 flow [2023-11-26 11:58:52,529 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-26 11:58:52,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:52,529 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-26 11:58:52,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 11:58:52,530 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-26 11:58:52,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash -65903341, now seen corresponding path program 1 times [2023-11-26 11:58:52,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:52,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669989780] [2023-11-26 11:58:52,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:52,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:53,408 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-26 11:58:53,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:53,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669989780] [2023-11-26 11:58:53,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669989780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:53,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:53,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:58:53,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104820264] [2023-11-26 11:58:53,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:53,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:58:53,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:53,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:58:53,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:58:53,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 475 [2023-11-26 11:58:53,798 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-26 11:58:53,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:53,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 475 [2023-11-26 11:58:53,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:54,639 INFO L124 PetriNetUnfolderBase]: 984/5037 cut-off events. [2023-11-26 11:58:54,639 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-11-26 11:58:54,716 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-26 11:58:54,745 INFO L140 encePairwiseOnDemand]: 470/475 looper letters, 14 selfloop transitions, 4 changer transitions 0/304 dead transitions. [2023-11-26 11:58:54,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 304 transitions, 738 flow [2023-11-26 11:58:54,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:58:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:58:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2683 transitions. [2023-11-26 11:58:54,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9414035087719298 [2023-11-26 11:58:54,755 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2683 transitions. [2023-11-26 11:58:54,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2683 transitions. [2023-11-26 11:58:54,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:54,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2683 transitions. [2023-11-26 11:58:54,765 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-26 11:58:54,771 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-26 11:58:54,772 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-26 11:58:54,772 INFO L175 Difference]: Start difference. First operand has 310 places, 305 transitions, 704 flow. Second operand 6 states and 2683 transitions. [2023-11-26 11:58:54,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 304 transitions, 738 flow [2023-11-26 11:58:54,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 304 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:54,782 INFO L231 Difference]: Finished difference. Result has 312 places, 304 transitions, 706 flow [2023-11-26 11:58:54,783 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-26 11:58:54,784 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -115 predicate places. [2023-11-26 11:58:54,784 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 304 transitions, 706 flow [2023-11-26 11:58:54,785 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-26 11:58:54,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:58:54,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-26 11:58:54,786 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-26 11:58:54,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:54,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1559852817, now seen corresponding path program 1 times [2023-11-26 11:58:54,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:54,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611313172] [2023-11-26 11:58:54,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:54,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:55,639 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-26 11:58:55,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:55,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611313172] [2023-11-26 11:58:55,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611313172] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:55,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:55,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:58:55,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74135295] [2023-11-26 11:58:55,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:55,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:58:55,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:55,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:58:55,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:58:56,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 475 [2023-11-26 11:58:56,030 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-26 11:58:56,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:56,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 475 [2023-11-26 11:58:56,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand