./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27898421-750b-4c09-adcd-9356c5d7ff48/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27898421-750b-4c09-adcd-9356c5d7ff48/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_27898421-750b-4c09-adcd-9356c5d7ff48/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27898421-750b-4c09-adcd-9356c5d7ff48/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27898421-750b-4c09-adcd-9356c5d7ff48/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_27898421-750b-4c09-adcd-9356c5d7ff48/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 8f6daa714ad29a28643c70bea2be7f060091d3c3adf6e85890e4056205fd8d77 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:54:10,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:54:10,604 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27898421-750b-4c09-adcd-9356c5d7ff48/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 11:54:10,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:54:10,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:54:10,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:54:10,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:54:10,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:54:10,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:54:10,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:54:10,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:54:10,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:54:10,666 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:54:10,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:54:10,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:54:10,669 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:54:10,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:54:10,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:54:10,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:54:10,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:54:10,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:54:10,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:54:10,673 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 11:54:10,674 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:54:10,674 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:54:10,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:54:10,675 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:54:10,676 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:54:10,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:54:10,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:54:10,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:54:10,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:54:10,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:54:10,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:54:10,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:54:10,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:54:10,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:54:10,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:54:10,691 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:54:10,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:54:10,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:54:10,692 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_27898421-750b-4c09-adcd-9356c5d7ff48/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_27898421-750b-4c09-adcd-9356c5d7ff48/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 -> 8f6daa714ad29a28643c70bea2be7f060091d3c3adf6e85890e4056205fd8d77 [2023-11-26 11:54:11,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:54:11,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:54:11,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:54:11,094 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:54:11,095 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:54:11,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27898421-750b-4c09-adcd-9356c5d7ff48/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i [2023-11-26 11:54:14,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:54:14,816 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:54:14,824 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27898421-750b-4c09-adcd-9356c5d7ff48/sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i [2023-11-26 11:54:14,851 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27898421-750b-4c09-adcd-9356c5d7ff48/bin/uautomizer-verify-VRDe98Ueme/data/4b65d5e22/ed56fbf419fd45009c767f3ec2cb9f06/FLAG629e089ae [2023-11-26 11:54:14,873 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27898421-750b-4c09-adcd-9356c5d7ff48/bin/uautomizer-verify-VRDe98Ueme/data/4b65d5e22/ed56fbf419fd45009c767f3ec2cb9f06 [2023-11-26 11:54:14,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:54:14,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:54:14,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:54:14,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:54:14,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:54:14,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:54:14" (1/1) ... [2023-11-26 11:54:14,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16883a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:14, skipping insertion in model container [2023-11-26 11:54:14,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:54:14" (1/1) ... [2023-11-26 11:54:14,987 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:54:15,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:54:15,513 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:54:15,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:54:15,652 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:54:15,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:15 WrapperNode [2023-11-26 11:54:15,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:54:15,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:54:15,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:54:15,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:54:15,664 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:54:15" (1/1) ... [2023-11-26 11:54:15,695 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:54:15" (1/1) ... [2023-11-26 11:54:15,727 INFO L138 Inliner]: procedures = 167, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2023-11-26 11:54:15,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:54:15,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:54:15,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:54:15,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:54:15,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:15" (1/1) ... [2023-11-26 11:54:15,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:15" (1/1) ... [2023-11-26 11:54:15,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:15" (1/1) ... [2023-11-26 11:54:15,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:15" (1/1) ... [2023-11-26 11:54:15,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:15" (1/1) ... [2023-11-26 11:54:15,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:15" (1/1) ... [2023-11-26 11:54:15,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:15" (1/1) ... [2023-11-26 11:54:15,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:15" (1/1) ... [2023-11-26 11:54:15,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:54:15,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:54:15,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:54:15,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:54:15,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:15" (1/1) ... [2023-11-26 11:54:15,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:54:15,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27898421-750b-4c09-adcd-9356c5d7ff48/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:54:15,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27898421-750b-4c09-adcd-9356c5d7ff48/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:54:15,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27898421-750b-4c09-adcd-9356c5d7ff48/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:54:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-26 11:54:15,884 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-26 11:54:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 11:54:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:54:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:54:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:54:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 11:54:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:54:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:54:15,888 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:54:16,049 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:54:16,052 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:54:16,229 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:54:16,242 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:54:16,243 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:54:16,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:54:16 BoogieIcfgContainer [2023-11-26 11:54:16,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:54:16,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:54:16,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:54:16,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:54:16,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:54:14" (1/3) ... [2023-11-26 11:54:16,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c3e2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:54:16, skipping insertion in model container [2023-11-26 11:54:16,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:15" (2/3) ... [2023-11-26 11:54:16,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c3e2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:54:16, skipping insertion in model container [2023-11-26 11:54:16,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:54:16" (3/3) ... [2023-11-26 11:54:16,258 INFO L112 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs-b.i [2023-11-26 11:54:16,270 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 11:54:16,285 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:54:16,285 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-26 11:54:16,286 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:54:16,370 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:54:16,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 60 transitions, 124 flow [2023-11-26 11:54:16,471 INFO L124 PetriNetUnfolderBase]: 4/71 cut-off events. [2023-11-26 11:54:16,472 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:54:16,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 71 events. 4/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2023-11-26 11:54:16,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 60 transitions, 124 flow [2023-11-26 11:54:16,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 60 transitions, 124 flow [2023-11-26 11:54:16,498 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:54:16,507 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;@475f5f48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:54:16,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-26 11:54:16,515 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:54:16,516 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-11-26 11:54:16,516 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:54:16,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:16,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:16,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 11:54:16,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:16,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1375649926, now seen corresponding path program 1 times [2023-11-26 11:54:16,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:16,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143087873] [2023-11-26 11:54:16,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:16,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:16,759 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:54:16,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:16,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143087873] [2023-11-26 11:54:16,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143087873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:16,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:16,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:16,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856580276] [2023-11-26 11:54:16,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:16,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:16,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:16,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:16,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:16,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 60 [2023-11-26 11:54:16,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:54:16,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:16,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 60 [2023-11-26 11:54:16,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:16,873 INFO L124 PetriNetUnfolderBase]: 0/51 cut-off events. [2023-11-26 11:54:16,915 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 11:54:16,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 0/51 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 20 event pairs, 0 based on Foata normal form. 6/54 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2023-11-26 11:54:16,918 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 6 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-26 11:54:16,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 114 flow [2023-11-26 11:54:16,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-26 11:54:16,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2023-11-26 11:54:16,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-26 11:54:16,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-26 11:54:16,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:16,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-26 11:54:16,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states 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:54:16,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:54:16,951 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:54:16,953 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 124 flow. Second operand 3 states and 148 transitions. [2023-11-26 11:54:16,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 114 flow [2023-11-26 11:54:16,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:54:16,978 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 102 flow [2023-11-26 11:54:16,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-11-26 11:54:16,984 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-26 11:54:16,984 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 102 flow [2023-11-26 11:54:16,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:54:16,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:16,985 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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:54:16,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:54:16,986 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-26 11:54:16,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1649860399, now seen corresponding path program 1 times [2023-11-26 11:54:16,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:16,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634140045] [2023-11-26 11:54:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:16,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:17,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:17,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:54:17,104 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:54:17,107 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-26 11:54:17,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2023-11-26 11:54:17,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2023-11-26 11:54:17,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2023-11-26 11:54:17,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2023-11-26 11:54:17,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2023-11-26 11:54:17,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:54:17,112 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-26 11:54:17,115 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 11:54:17,116 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-26 11:54:17,148 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:54:17,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 87 transitions, 184 flow [2023-11-26 11:54:17,188 INFO L124 PetriNetUnfolderBase]: 7/111 cut-off events. [2023-11-26 11:54:17,189 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 11:54:17,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 111 events. 7/111 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 192 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 72. Up to 6 conditions per place. [2023-11-26 11:54:17,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 87 transitions, 184 flow [2023-11-26 11:54:17,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 87 transitions, 184 flow [2023-11-26 11:54:17,195 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:54:17,197 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;@475f5f48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:54:17,197 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-26 11:54:17,201 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:54:17,201 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-11-26 11:54:17,202 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:54:17,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:17,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:17,202 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:54:17,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:17,203 INFO L85 PathProgramCache]: Analyzing trace with hash 754094269, now seen corresponding path program 1 times [2023-11-26 11:54:17,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:17,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863790046] [2023-11-26 11:54:17,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:17,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:17,257 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:54:17,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:17,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863790046] [2023-11-26 11:54:17,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863790046] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:17,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:17,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:17,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236964436] [2023-11-26 11:54:17,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:17,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:17,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:17,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:17,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:17,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 87 [2023-11-26 11:54:17,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 87 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states 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:54:17,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:17,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 87 [2023-11-26 11:54:17,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:17,407 INFO L124 PetriNetUnfolderBase]: 6/143 cut-off events. [2023-11-26 11:54:17,407 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-26 11:54:17,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 143 events. 6/143 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 394 event pairs, 6 based on Foata normal form. 27/157 useless extension candidates. Maximal degree in co-relation 43. Up to 22 conditions per place. [2023-11-26 11:54:17,409 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 9 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-26 11:54:17,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 69 transitions, 170 flow [2023-11-26 11:54:17,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2023-11-26 11:54:17,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8275862068965517 [2023-11-26 11:54:17,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 216 transitions. [2023-11-26 11:54:17,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 216 transitions. [2023-11-26 11:54:17,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:17,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 216 transitions. [2023-11-26 11:54:17,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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:54:17,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:54:17,427 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:54:17,427 INFO L175 Difference]: Start difference. First operand has 87 places, 87 transitions, 184 flow. Second operand 3 states and 216 transitions. [2023-11-26 11:54:17,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 69 transitions, 170 flow [2023-11-26 11:54:17,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 69 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:54:17,431 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 152 flow [2023-11-26 11:54:17,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2023-11-26 11:54:17,437 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -11 predicate places. [2023-11-26 11:54:17,438 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 152 flow [2023-11-26 11:54:17,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states 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:54:17,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:17,439 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:54:17,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:54:17,440 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:54:17,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:17,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1382469862, now seen corresponding path program 1 times [2023-11-26 11:54:17,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:17,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902545884] [2023-11-26 11:54:17,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:17,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:17,530 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:54:17,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:17,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902545884] [2023-11-26 11:54:17,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902545884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:17,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:17,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921127946] [2023-11-26 11:54:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:17,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:17,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:17,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:17,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:17,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 87 [2023-11-26 11:54:17,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states 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:54:17,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:17,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 87 [2023-11-26 11:54:17,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:17,656 INFO L124 PetriNetUnfolderBase]: 18/189 cut-off events. [2023-11-26 11:54:17,657 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-26 11:54:17,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 189 events. 18/189 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 719 event pairs, 9 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 240. Up to 38 conditions per place. [2023-11-26 11:54:17,660 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 11 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-11-26 11:54:17,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 199 flow [2023-11-26 11:54:17,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2023-11-26 11:54:17,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8467432950191571 [2023-11-26 11:54:17,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 221 transitions. [2023-11-26 11:54:17,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 221 transitions. [2023-11-26 11:54:17,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:17,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 221 transitions. [2023-11-26 11:54:17,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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:54:17,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:54:17,669 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:54:17,669 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 152 flow. Second operand 3 states and 221 transitions. [2023-11-26 11:54:17,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 199 flow [2023-11-26 11:54:17,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 74 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:17,673 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 186 flow [2023-11-26 11:54:17,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2023-11-26 11:54:17,675 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -9 predicate places. [2023-11-26 11:54:17,675 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 186 flow [2023-11-26 11:54:17,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states 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:54:17,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:17,676 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] [2023-11-26 11:54:17,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:54:17,677 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:54:17,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:17,678 INFO L85 PathProgramCache]: Analyzing trace with hash -717967508, now seen corresponding path program 1 times [2023-11-26 11:54:17,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:17,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974793978] [2023-11-26 11:54:17,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:17,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:17,746 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:54:17,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:17,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974793978] [2023-11-26 11:54:17,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974793978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:17,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:17,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:17,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428412103] [2023-11-26 11:54:17,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:17,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:17,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:17,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:17,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:17,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 87 [2023-11-26 11:54:17,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states 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:54:17,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:17,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 87 [2023-11-26 11:54:17,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:17,828 INFO L124 PetriNetUnfolderBase]: 21/231 cut-off events. [2023-11-26 11:54:17,829 INFO L125 PetriNetUnfolderBase]: For 48/50 co-relation queries the response was YES. [2023-11-26 11:54:17,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 231 events. 21/231 cut-off events. For 48/50 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 991 event pairs, 4 based on Foata normal form. 1/204 useless extension candidates. Maximal degree in co-relation 155. Up to 38 conditions per place. [2023-11-26 11:54:17,832 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 13 selfloop transitions, 7 changer transitions 0/80 dead transitions. [2023-11-26 11:54:17,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 80 transitions, 253 flow [2023-11-26 11:54:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2023-11-26 11:54:17,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8582375478927203 [2023-11-26 11:54:17,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2023-11-26 11:54:17,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2023-11-26 11:54:17,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:17,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2023-11-26 11:54:17,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:54:17,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:54:17,839 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:54:17,839 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 186 flow. Second operand 3 states and 224 transitions. [2023-11-26 11:54:17,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 80 transitions, 253 flow [2023-11-26 11:54:17,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 80 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:17,843 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 238 flow [2023-11-26 11:54:17,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=80, PETRI_TRANSITIONS=79} [2023-11-26 11:54:17,844 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -7 predicate places. [2023-11-26 11:54:17,845 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 238 flow [2023-11-26 11:54:17,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states 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:54:17,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:17,845 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 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:54:17,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:54:17,846 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:54:17,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:17,847 INFO L85 PathProgramCache]: Analyzing trace with hash -704413453, now seen corresponding path program 1 times [2023-11-26 11:54:17,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:17,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051769389] [2023-11-26 11:54:17,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:17,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:17,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:17,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:54:17,914 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:54:17,914 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2023-11-26 11:54:17,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2023-11-26 11:54:17,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2023-11-26 11:54:17,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2023-11-26 11:54:17,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2023-11-26 11:54:17,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2023-11-26 11:54:17,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2023-11-26 11:54:17,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2023-11-26 11:54:17,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:54:17,922 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-26 11:54:17,922 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 11:54:17,923 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-26 11:54:17,972 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:54:17,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 114 transitions, 246 flow [2023-11-26 11:54:18,011 INFO L124 PetriNetUnfolderBase]: 10/151 cut-off events. [2023-11-26 11:54:18,012 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 11:54:18,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 151 events. 10/151 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 334 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 115. Up to 8 conditions per place. [2023-11-26 11:54:18,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 114 transitions, 246 flow [2023-11-26 11:54:18,021 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 114 transitions, 246 flow [2023-11-26 11:54:18,024 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:54:18,028 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;@475f5f48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:54:18,028 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-26 11:54:18,031 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:54:18,031 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-11-26 11:54:18,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:54:18,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:18,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:18,034 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-26 11:54:18,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash 532051311, now seen corresponding path program 1 times [2023-11-26 11:54:18,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:18,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731613839] [2023-11-26 11:54:18,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:18,068 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:54:18,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:18,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731613839] [2023-11-26 11:54:18,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731613839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:18,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:18,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:18,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115728474] [2023-11-26 11:54:18,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:18,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:18,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:18,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:18,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:18,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2023-11-26 11:54:18,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 114 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states 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:54:18,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:18,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2023-11-26 11:54:18,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:18,210 INFO L124 PetriNetUnfolderBase]: 42/437 cut-off events. [2023-11-26 11:54:18,210 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-11-26 11:54:18,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 437 events. 42/437 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2447 event pairs, 42 based on Foata normal form. 108/502 useless extension candidates. Maximal degree in co-relation 174. Up to 85 conditions per place. [2023-11-26 11:54:18,215 INFO L140 encePairwiseOnDemand]: 103/114 looper letters, 12 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-11-26 11:54:18,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 91 transitions, 228 flow [2023-11-26 11:54:18,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2023-11-26 11:54:18,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8304093567251462 [2023-11-26 11:54:18,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2023-11-26 11:54:18,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2023-11-26 11:54:18,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:18,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2023-11-26 11:54:18,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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:54:18,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:54:18,222 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:54:18,222 INFO L175 Difference]: Start difference. First operand has 114 places, 114 transitions, 246 flow. Second operand 3 states and 284 transitions. [2023-11-26 11:54:18,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 91 transitions, 228 flow [2023-11-26 11:54:18,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 91 transitions, 226 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-26 11:54:18,228 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 202 flow [2023-11-26 11:54:18,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2023-11-26 11:54:18,229 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -14 predicate places. [2023-11-26 11:54:18,230 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 202 flow [2023-11-26 11:54:18,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states 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:54:18,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:18,230 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:54:18,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:54:18,231 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-26 11:54:18,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:18,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1320317734, now seen corresponding path program 1 times [2023-11-26 11:54:18,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:18,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113555390] [2023-11-26 11:54:18,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:18,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:18,275 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:54:18,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:18,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113555390] [2023-11-26 11:54:18,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113555390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:18,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:18,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297754941] [2023-11-26 11:54:18,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:18,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:18,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:18,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:18,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:18,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2023-11-26 11:54:18,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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:54:18,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:18,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2023-11-26 11:54:18,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:18,444 INFO L124 PetriNetUnfolderBase]: 135/768 cut-off events. [2023-11-26 11:54:18,444 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2023-11-26 11:54:18,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 768 events. 135/768 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5305 event pairs, 80 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 1086. Up to 201 conditions per place. [2023-11-26 11:54:18,455 INFO L140 encePairwiseOnDemand]: 106/114 looper letters, 15 selfloop transitions, 7 changer transitions 0/99 dead transitions. [2023-11-26 11:54:18,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 99 transitions, 272 flow [2023-11-26 11:54:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2023-11-26 11:54:18,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2023-11-26 11:54:18,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 290 transitions. [2023-11-26 11:54:18,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 290 transitions. [2023-11-26 11:54:18,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:18,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 290 transitions. [2023-11-26 11:54:18,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:54:18,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:54:18,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:54:18,462 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 202 flow. Second operand 3 states and 290 transitions. [2023-11-26 11:54:18,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 99 transitions, 272 flow [2023-11-26 11:54:18,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 99 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:18,467 INFO L231 Difference]: Finished difference. Result has 102 places, 97 transitions, 252 flow [2023-11-26 11:54:18,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=102, PETRI_TRANSITIONS=97} [2023-11-26 11:54:18,468 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -12 predicate places. [2023-11-26 11:54:18,469 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 97 transitions, 252 flow [2023-11-26 11:54:18,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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:54:18,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:18,470 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] [2023-11-26 11:54:18,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:54:18,470 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-26 11:54:18,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:18,471 INFO L85 PathProgramCache]: Analyzing trace with hash 275520018, now seen corresponding path program 1 times [2023-11-26 11:54:18,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:18,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207810027] [2023-11-26 11:54:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:18,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:18,544 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:54:18,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:18,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207810027] [2023-11-26 11:54:18,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207810027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:18,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:18,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:18,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537520858] [2023-11-26 11:54:18,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:18,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:18,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:18,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:18,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:18,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2023-11-26 11:54:18,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 97 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states 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:54:18,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:18,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2023-11-26 11:54:18,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:18,886 INFO L124 PetriNetUnfolderBase]: 351/1582 cut-off events. [2023-11-26 11:54:18,887 INFO L125 PetriNetUnfolderBase]: For 531/597 co-relation queries the response was YES. [2023-11-26 11:54:18,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2808 conditions, 1582 events. 351/1582 cut-off events. For 531/597 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 13580 event pairs, 79 based on Foata normal form. 3/1320 useless extension candidates. Maximal degree in co-relation 1412. Up to 392 conditions per place. [2023-11-26 11:54:18,908 INFO L140 encePairwiseOnDemand]: 102/114 looper letters, 22 selfloop transitions, 13 changer transitions 0/112 dead transitions. [2023-11-26 11:54:18,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 112 transitions, 390 flow [2023-11-26 11:54:18,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:18,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2023-11-26 11:54:18,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8508771929824561 [2023-11-26 11:54:18,911 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 291 transitions. [2023-11-26 11:54:18,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 291 transitions. [2023-11-26 11:54:18,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:18,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 291 transitions. [2023-11-26 11:54:18,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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:54:18,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:54:18,915 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:54:18,915 INFO L175 Difference]: Start difference. First operand has 102 places, 97 transitions, 252 flow. Second operand 3 states and 291 transitions. [2023-11-26 11:54:18,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 112 transitions, 390 flow [2023-11-26 11:54:18,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 112 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:18,922 INFO L231 Difference]: Finished difference. Result has 104 places, 110 transitions, 366 flow [2023-11-26 11:54:18,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=104, PETRI_TRANSITIONS=110} [2023-11-26 11:54:18,923 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -10 predicate places. [2023-11-26 11:54:18,923 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 110 transitions, 366 flow [2023-11-26 11:54:18,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states 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:54:18,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:18,924 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:18,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:54:18,925 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-26 11:54:18,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:18,925 INFO L85 PathProgramCache]: Analyzing trace with hash -181839690, now seen corresponding path program 1 times [2023-11-26 11:54:18,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:18,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973851154] [2023-11-26 11:54:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:18,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-26 11:54:19,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:19,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973851154] [2023-11-26 11:54:19,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973851154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:19,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:19,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:19,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454529322] [2023-11-26 11:54:19,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:19,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:19,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:19,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:19,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:19,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2023-11-26 11:54:19,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 110 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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:54:19,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:19,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2023-11-26 11:54:19,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:19,617 INFO L124 PetriNetUnfolderBase]: 602/2319 cut-off events. [2023-11-26 11:54:19,617 INFO L125 PetriNetUnfolderBase]: For 2055/2869 co-relation queries the response was YES. [2023-11-26 11:54:19,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5126 conditions, 2319 events. 602/2319 cut-off events. For 2055/2869 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 21206 event pairs, 134 based on Foata normal form. 10/1941 useless extension candidates. Maximal degree in co-relation 2308. Up to 685 conditions per place. [2023-11-26 11:54:19,657 INFO L140 encePairwiseOnDemand]: 106/114 looper letters, 25 selfloop transitions, 16 changer transitions 0/123 dead transitions. [2023-11-26 11:54:19,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 123 transitions, 525 flow [2023-11-26 11:54:19,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2023-11-26 11:54:19,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8450292397660819 [2023-11-26 11:54:19,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 289 transitions. [2023-11-26 11:54:19,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions. [2023-11-26 11:54:19,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:19,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions. [2023-11-26 11:54:19,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states 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:54:19,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:54:19,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:54:19,664 INFO L175 Difference]: Start difference. First operand has 104 places, 110 transitions, 366 flow. Second operand 3 states and 289 transitions. [2023-11-26 11:54:19,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 123 transitions, 525 flow [2023-11-26 11:54:19,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 123 transitions, 489 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:19,676 INFO L231 Difference]: Finished difference. Result has 106 places, 122 transitions, 490 flow [2023-11-26 11:54:19,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=106, PETRI_TRANSITIONS=122} [2023-11-26 11:54:19,680 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -8 predicate places. [2023-11-26 11:54:19,680 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 122 transitions, 490 flow [2023-11-26 11:54:19,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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:54:19,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:19,681 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 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:54:19,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:54:19,682 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-26 11:54:19,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:19,683 INFO L85 PathProgramCache]: Analyzing trace with hash 189985902, now seen corresponding path program 1 times [2023-11-26 11:54:19,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:19,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707284839] [2023-11-26 11:54:19,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:19,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:19,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:19,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:54:19,770 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:54:19,770 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2023-11-26 11:54:19,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2023-11-26 11:54:19,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2023-11-26 11:54:19,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2023-11-26 11:54:19,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2023-11-26 11:54:19,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2023-11-26 11:54:19,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2023-11-26 11:54:19,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2023-11-26 11:54:19,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2023-11-26 11:54:19,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2023-11-26 11:54:19,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:54:19,773 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-26 11:54:19,774 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 11:54:19,774 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-26 11:54:19,821 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:54:19,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 141 transitions, 310 flow [2023-11-26 11:54:19,848 INFO L124 PetriNetUnfolderBase]: 13/191 cut-off events. [2023-11-26 11:54:19,849 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-26 11:54:19,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 191 events. 13/191 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 482 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 159. Up to 10 conditions per place. [2023-11-26 11:54:19,851 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 141 transitions, 310 flow [2023-11-26 11:54:19,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 141 transitions, 310 flow [2023-11-26 11:54:19,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:54:19,855 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;@475f5f48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:54:19,855 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-26 11:54:19,857 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:54:19,857 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-11-26 11:54:19,858 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:54:19,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:19,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:19,858 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-26 11:54:19,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:19,859 INFO L85 PathProgramCache]: Analyzing trace with hash 709521052, now seen corresponding path program 1 times [2023-11-26 11:54:19,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:19,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300621191] [2023-11-26 11:54:19,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:19,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:19,881 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:54:19,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:19,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300621191] [2023-11-26 11:54:19,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300621191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:19,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:19,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:19,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151891849] [2023-11-26 11:54:19,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:19,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:19,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:19,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:19,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:19,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 141 [2023-11-26 11:54:19,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 141 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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:54:19,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:19,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2023-11-26 11:54:19,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:20,243 INFO L124 PetriNetUnfolderBase]: 204/1373 cut-off events. [2023-11-26 11:54:20,243 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2023-11-26 11:54:20,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 1373 events. 204/1373 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 11067 event pairs, 204 based on Foata normal form. 405/1645 useless extension candidates. Maximal degree in co-relation 562. Up to 328 conditions per place. [2023-11-26 11:54:20,263 INFO L140 encePairwiseOnDemand]: 128/141 looper letters, 15 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2023-11-26 11:54:20,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 113 transitions, 288 flow [2023-11-26 11:54:20,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-11-26 11:54:20,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8321513002364066 [2023-11-26 11:54:20,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-11-26 11:54:20,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-11-26 11:54:20,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:20,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-11-26 11:54:20,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states 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:54:20,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:54:20,270 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:54:20,270 INFO L175 Difference]: Start difference. First operand has 141 places, 141 transitions, 310 flow. Second operand 3 states and 352 transitions. [2023-11-26 11:54:20,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 113 transitions, 288 flow [2023-11-26 11:54:20,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 113 transitions, 282 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-26 11:54:20,275 INFO L231 Difference]: Finished difference. Result has 124 places, 113 transitions, 252 flow [2023-11-26 11:54:20,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=124, PETRI_TRANSITIONS=113} [2023-11-26 11:54:20,276 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -17 predicate places. [2023-11-26 11:54:20,276 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 113 transitions, 252 flow [2023-11-26 11:54:20,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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:54:20,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:20,277 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:54:20,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:54:20,277 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-26 11:54:20,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:20,278 INFO L85 PathProgramCache]: Analyzing trace with hash -333614707, now seen corresponding path program 1 times [2023-11-26 11:54:20,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:20,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336616174] [2023-11-26 11:54:20,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:20,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:20,312 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:54:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:20,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336616174] [2023-11-26 11:54:20,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336616174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:20,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:20,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:20,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763056603] [2023-11-26 11:54:20,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:20,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:20,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:20,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2023-11-26 11:54:20,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 113 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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:54:20,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:20,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2023-11-26 11:54:20,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:20,965 INFO L124 PetriNetUnfolderBase]: 663/2774 cut-off events. [2023-11-26 11:54:20,966 INFO L125 PetriNetUnfolderBase]: For 578/578 co-relation queries the response was YES. [2023-11-26 11:54:20,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4121 conditions, 2774 events. 663/2774 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 25319 event pairs, 422 based on Foata normal form. 0/2408 useless extension candidates. Maximal degree in co-relation 4094. Up to 871 conditions per place. [2023-11-26 11:54:21,020 INFO L140 encePairwiseOnDemand]: 131/141 looper letters, 19 selfloop transitions, 9 changer transitions 0/124 dead transitions. [2023-11-26 11:54:21,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 124 transitions, 345 flow [2023-11-26 11:54:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-11-26 11:54:21,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8486997635933806 [2023-11-26 11:54:21,024 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-11-26 11:54:21,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-11-26 11:54:21,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:21,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-11-26 11:54:21,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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:54:21,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:54:21,029 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:54:21,030 INFO L175 Difference]: Start difference. First operand has 124 places, 113 transitions, 252 flow. Second operand 3 states and 359 transitions. [2023-11-26 11:54:21,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 124 transitions, 345 flow [2023-11-26 11:54:21,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 124 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:21,037 INFO L231 Difference]: Finished difference. Result has 126 places, 121 transitions, 318 flow [2023-11-26 11:54:21,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=126, PETRI_TRANSITIONS=121} [2023-11-26 11:54:21,039 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -15 predicate places. [2023-11-26 11:54:21,039 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 121 transitions, 318 flow [2023-11-26 11:54:21,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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:54:21,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:21,040 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] [2023-11-26 11:54:21,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:54:21,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-26 11:54:21,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:21,042 INFO L85 PathProgramCache]: Analyzing trace with hash -160844270, now seen corresponding path program 1 times [2023-11-26 11:54:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:21,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082469168] [2023-11-26 11:54:21,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:21,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:21,093 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:54:21,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:21,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082469168] [2023-11-26 11:54:21,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082469168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:21,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:21,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:21,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678724691] [2023-11-26 11:54:21,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:21,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:21,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:21,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:21,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:21,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 141 [2023-11-26 11:54:21,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 121 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states 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:54:21,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:21,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 141 [2023-11-26 11:54:21,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:23,147 INFO L124 PetriNetUnfolderBase]: 3464/10629 cut-off events. [2023-11-26 11:54:23,148 INFO L125 PetriNetUnfolderBase]: For 4336/4726 co-relation queries the response was YES. [2023-11-26 11:54:23,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20572 conditions, 10629 events. 3464/10629 cut-off events. For 4336/4726 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 118040 event pairs, 858 based on Foata normal form. 9/8681 useless extension candidates. Maximal degree in co-relation 11139. Up to 3171 conditions per place. [2023-11-26 11:54:23,412 INFO L140 encePairwiseOnDemand]: 125/141 looper letters, 30 selfloop transitions, 18 changer transitions 0/142 dead transitions. [2023-11-26 11:54:23,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 142 transitions, 511 flow [2023-11-26 11:54:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-11-26 11:54:23,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8463356973995272 [2023-11-26 11:54:23,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-11-26 11:54:23,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-11-26 11:54:23,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:23,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-11-26 11:54:23,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states 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:54:23,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:54:23,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:54:23,421 INFO L175 Difference]: Start difference. First operand has 126 places, 121 transitions, 318 flow. Second operand 3 states and 358 transitions. [2023-11-26 11:54:23,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 142 transitions, 511 flow [2023-11-26 11:54:23,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 142 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:23,447 INFO L231 Difference]: Finished difference. Result has 128 places, 139 transitions, 478 flow [2023-11-26 11:54:23,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=128, PETRI_TRANSITIONS=139} [2023-11-26 11:54:23,450 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -13 predicate places. [2023-11-26 11:54:23,450 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 139 transitions, 478 flow [2023-11-26 11:54:23,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states 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:54:23,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:23,451 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:23,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:54:23,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-26 11:54:23,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:23,453 INFO L85 PathProgramCache]: Analyzing trace with hash -15886282, now seen corresponding path program 1 times [2023-11-26 11:54:23,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:23,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514121902] [2023-11-26 11:54:23,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:23,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-26 11:54:23,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:23,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514121902] [2023-11-26 11:54:23,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514121902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:23,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:23,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:23,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501059030] [2023-11-26 11:54:23,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:23,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:23,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:23,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:23,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:23,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2023-11-26 11:54:23,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 139 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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:54:23,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:23,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2023-11-26 11:54:23,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:25,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][118], [114#L698-5true, thr1Thread1of4ForFork0InUse, 62#L691-2true, 91#$Ultimate##0true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 81#L691-1true, thr1Thread4of4ForFork0InUse, 156#(= |#race~s~0| 0), 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 45#L691-2true, Black: 154#true]) [2023-11-26 11:54:25,373 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-26 11:54:25,373 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-26 11:54:25,373 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-26 11:54:25,373 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-26 11:54:25,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][119], [114#L698-5true, thr1Thread1of4ForFork0InUse, 91#$Ultimate##0true, 134#L691-1true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 156#(= |#race~s~0| 0), 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 45#L691-2true, 93#L691-2true, Black: 154#true]) [2023-11-26 11:54:25,387 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-26 11:54:25,388 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-26 11:54:25,388 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-26 11:54:25,388 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-26 11:54:26,442 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L690-2-->L690-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet4#1_3| |v_#race~s~0_1|) InVars {thr1Thread4of4ForFork0_#t~nondet4#1=|v_thr1Thread4of4ForFork0_#t~nondet4#1_3|} OutVars{#race~s~0=|v_#race~s~0_1|, thr1Thread4of4ForFork0_#t~nondet4#1=|v_thr1Thread4of4ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[#race~s~0][139], [154#true, 114#L698-5true, thr1Thread1of4ForFork0InUse, 62#L691-2true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 5#L691true, 35#L690-3true, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 45#L691-2true, Black: 156#(= |#race~s~0| 0)]) [2023-11-26 11:54:26,443 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-26 11:54:26,443 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 11:54:26,443 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 11:54:26,444 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 11:54:26,745 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L690-2-->L690-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet4#1_3| |v_#race~s~0_1|) InVars {thr1Thread4of4ForFork0_#t~nondet4#1=|v_thr1Thread4of4ForFork0_#t~nondet4#1_3|} OutVars{#race~s~0=|v_#race~s~0_1|, thr1Thread4of4ForFork0_#t~nondet4#1=|v_thr1Thread4of4ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[#race~s~0][139], [154#true, 114#L698-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 35#L690-3true, 160#true, 128#L691true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 45#L691-2true, 93#L691-2true, Black: 156#(= |#race~s~0| 0)]) [2023-11-26 11:54:26,745 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is not cut-off event [2023-11-26 11:54:26,746 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is not cut-off event [2023-11-26 11:54:26,746 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is not cut-off event [2023-11-26 11:54:26,746 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is not cut-off event [2023-11-26 11:54:26,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][118], [114#L698-5true, thr1Thread1of4ForFork0InUse, 56#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 81#L691-1true, 156#(= |#race~s~0| 0), 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 22#L691-2true, 45#L691-2true, Black: 154#true]) [2023-11-26 11:54:26,926 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-26 11:54:26,926 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-26 11:54:26,926 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-26 11:54:26,926 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-26 11:54:27,343 INFO L124 PetriNetUnfolderBase]: 6501/18564 cut-off events. [2023-11-26 11:54:27,344 INFO L125 PetriNetUnfolderBase]: For 22175/26740 co-relation queries the response was YES. [2023-11-26 11:54:27,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44472 conditions, 18564 events. 6501/18564 cut-off events. For 22175/26740 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 219880 event pairs, 1506 based on Foata normal form. 95/15302 useless extension candidates. Maximal degree in co-relation 22588. Up to 6365 conditions per place. [2023-11-26 11:54:27,627 INFO L140 encePairwiseOnDemand]: 131/141 looper letters, 35 selfloop transitions, 26 changer transitions 0/163 dead transitions. [2023-11-26 11:54:27,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 163 transitions, 754 flow [2023-11-26 11:54:27,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-11-26 11:54:27,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8463356973995272 [2023-11-26 11:54:27,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-11-26 11:54:27,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-11-26 11:54:27,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:27,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-11-26 11:54:27,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states 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:54:27,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:54:27,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:54:27,634 INFO L175 Difference]: Start difference. First operand has 128 places, 139 transitions, 478 flow. Second operand 3 states and 358 transitions. [2023-11-26 11:54:27,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 163 transitions, 754 flow [2023-11-26 11:54:27,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 163 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:27,686 INFO L231 Difference]: Finished difference. Result has 130 places, 161 transitions, 712 flow [2023-11-26 11:54:27,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=130, PETRI_TRANSITIONS=161} [2023-11-26 11:54:27,687 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -11 predicate places. [2023-11-26 11:54:27,687 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 161 transitions, 712 flow [2023-11-26 11:54:27,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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:54:27,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:27,688 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:54:27,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:54:27,689 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-26 11:54:27,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:27,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1290736722, now seen corresponding path program 1 times [2023-11-26 11:54:27,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:27,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500379810] [2023-11-26 11:54:27,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:27,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-26 11:54:27,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:27,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500379810] [2023-11-26 11:54:27,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500379810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:27,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:27,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:27,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76766161] [2023-11-26 11:54:27,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:27,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:54:27,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:27,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:27,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:27,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2023-11-26 11:54:27,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 161 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:54:27,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:54:27,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2023-11-26 11:54:27,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:54:30,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][193], [75#L690-4true, 114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), thr1Thread1of4ForFork0InUse, 134#L691-1true, 166#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 119#L690-4true, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 22#L691-2true, Black: 154#true]) [2023-11-26 11:54:30,450 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,450 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,450 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,450 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][192], [114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 166#true, thr1Thread3of4ForFork0InUse, 81#L691-1true, thr1Thread4of4ForFork0InUse, 119#L690-4true, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 98#L690-4true, 22#L691-2true, Black: 154#true]) [2023-11-26 11:54:30,601 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,601 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,601 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,601 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([492] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][191], [75#L690-4true, 114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), thr1Thread1of4ForFork0InUse, 53#L691-1true, 166#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 22#L691-2true, 98#L690-4true, Black: 154#true]) [2023-11-26 11:54:30,606 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,606 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,606 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,606 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][117], [9#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), thr1Thread1of4ForFork0InUse, 134#L691-1true, 166#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 4#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 22#L691-2true, Black: 154#true]) [2023-11-26 11:54:30,741 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,741 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,741 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,742 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][103], [9#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), 73#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 166#true, thr1Thread3of4ForFork0InUse, 81#L691-1true, thr1Thread4of4ForFork0InUse, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 98#L690-4true, Black: 154#true]) [2023-11-26 11:54:30,772 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,772 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,772 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,772 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][102], [75#L690-4true, 9#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), 73#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, 134#L691-1true, thr1Thread2of4ForFork0InUse, 166#true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), Black: 154#true]) [2023-11-26 11:54:30,836 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,836 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,836 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:30,836 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:54:31,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([492] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][147], [114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), thr1Thread1of4ForFork0InUse, 53#L691-1true, 166#true, thr1Thread2of4ForFork0InUse, 62#L691-2true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 4#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 22#L691-2true, Black: 154#true]) [2023-11-26 11:54:31,397 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-26 11:54:31,397 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-26 11:54:31,397 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-26 11:54:31,397 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-26 11:54:31,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([492] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][147], [114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), thr1Thread1of4ForFork0InUse, 53#L691-1true, 166#true, 56#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 22#L691-2true, 93#L691-2true, Black: 154#true]) [2023-11-26 11:54:31,462 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-26 11:54:31,462 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-26 11:54:31,462 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-26 11:54:31,462 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-26 11:54:31,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][116], [114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), thr1Thread1of4ForFork0InUse, 166#true, 56#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 81#L691-1true, thr1Thread4of4ForFork0InUse, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 22#L691-2true, 45#L691-2true, Black: 154#true]) [2023-11-26 11:54:31,470 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-26 11:54:31,470 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-26 11:54:31,470 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-26 11:54:31,471 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-26 11:54:31,971 INFO L124 PetriNetUnfolderBase]: 10495/27044 cut-off events. [2023-11-26 11:54:31,971 INFO L125 PetriNetUnfolderBase]: For 47205/65055 co-relation queries the response was YES. [2023-11-26 11:54:32,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73307 conditions, 27044 events. 10495/27044 cut-off events. For 47205/65055 co-relation queries the response was YES. Maximal size of possible extension queue 1314. Compared 324732 event pairs, 1973 based on Foata normal form. 90/21349 useless extension candidates. Maximal degree in co-relation 33109. Up to 9927 conditions per place. [2023-11-26 11:54:32,345 INFO L140 encePairwiseOnDemand]: 131/141 looper letters, 50 selfloop transitions, 40 changer transitions 0/194 dead transitions. [2023-11-26 11:54:32,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 194 transitions, 1155 flow [2023-11-26 11:54:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:54:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-11-26 11:54:32,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8439716312056738 [2023-11-26 11:54:32,350 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-11-26 11:54:32,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-11-26 11:54:32,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:32,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-11-26 11:54:32,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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:54:32,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:54:32,355 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:54:32,355 INFO L175 Difference]: Start difference. First operand has 130 places, 161 transitions, 712 flow. Second operand 3 states and 357 transitions. [2023-11-26 11:54:32,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 194 transitions, 1155 flow [2023-11-26 11:54:32,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 194 transitions, 1075 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:54:32,455 INFO L231 Difference]: Finished difference. Result has 132 places, 193 transitions, 1114 flow [2023-11-26 11:54:32,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1114, PETRI_PLACES=132, PETRI_TRANSITIONS=193} [2023-11-26 11:54:32,458 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -9 predicate places. [2023-11-26 11:54:32,458 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 193 transitions, 1114 flow [2023-11-26 11:54:32,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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:54:32,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:54:32,459 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:32,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:54:32,459 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-26 11:54:32,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:32,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2047107692, now seen corresponding path program 1 times [2023-11-26 11:54:32,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:32,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659227900] [2023-11-26 11:54:32,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:32,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:32,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:32,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:54:32,512 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:54:32,512 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 12 remaining) [2023-11-26 11:54:32,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2023-11-26 11:54:32,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2023-11-26 11:54:32,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2023-11-26 11:54:32,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 12 remaining) [2023-11-26 11:54:32,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2023-11-26 11:54:32,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2023-11-26 11:54:32,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2023-11-26 11:54:32,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2023-11-26 11:54:32,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2023-11-26 11:54:32,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2023-11-26 11:54:32,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2023-11-26 11:54:32,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:54:32,517 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-26 11:54:32,524 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2023-11-26 11:54:32,524 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:54:32,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-26 11:54:32,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-26 11:54:32,595 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:54:32,596 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-26 11:54:32,596 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 11:54:32,596 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:54:32,597 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-26 11:54:32,597 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 11:54:32,597 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 11:54:32,597 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 11:54:32,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:54:32 BasicIcfg [2023-11-26 11:54:32,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:54:32,611 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:54:32,611 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:54:32,611 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:54:32,612 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:54:16" (3/4) ... [2023-11-26 11:54:32,614 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:54:32,615 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:54:32,616 INFO L158 Benchmark]: Toolchain (without parser) took 17734.19ms. Allocated memory was 155.2MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 108.3MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 515.0MB. Max. memory is 16.1GB. [2023-11-26 11:54:32,617 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 155.2MB. Free memory was 120.0MB in the beginning and 119.9MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:54:32,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 767.42ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 88.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-26 11:54:32,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.06ms. Allocated memory is still 155.2MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:54:32,618 INFO L158 Benchmark]: Boogie Preprocessor took 57.28ms. Allocated memory is still 155.2MB. Free memory was 87.4MB in the beginning and 85.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:54:32,618 INFO L158 Benchmark]: RCFGBuilder took 458.81ms. Allocated memory is still 155.2MB. Free memory was 85.8MB in the beginning and 74.2MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-26 11:54:32,619 INFO L158 Benchmark]: TraceAbstraction took 16361.35ms. Allocated memory was 155.2MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 73.8MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 481.4MB. Max. memory is 16.1GB. [2023-11-26 11:54:32,620 INFO L158 Benchmark]: Witness Printer took 4.94ms. Allocated memory is still 3.8GB. Free memory is still 3.3GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:54:32,623 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.84ms. Allocated memory is still 155.2MB. Free memory was 120.0MB in the beginning and 119.9MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 767.42ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 88.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.06ms. Allocated memory is still 155.2MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.28ms. Allocated memory is still 155.2MB. Free memory was 87.4MB in the beginning and 85.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 458.81ms. Allocated memory is still 155.2MB. Free memory was 85.8MB in the beginning and 74.2MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16361.35ms. Allocated memory was 155.2MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 73.8MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 481.4MB. Max. memory is 16.1GB. * Witness Printer took 4.94ms. Allocated memory is still 3.8GB. Free memory is still 3.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 690]: Data race detected [2023-11-26 11:54:32,678 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-26 11:54:32,678 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-26 11:54:32,678 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:54:32,679 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-26 11:54:32,679 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 11:54:32,679 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:54:32,686 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 11:54:32,686 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-26 11:54:32,686 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 11:54:32,687 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 11:54:32,710 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-26 11:54:32,710 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-26 11:54:32,711 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:54:32,712 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-26 11:54:32,712 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 11:54:32,713 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:54:32,713 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-26 11:54:32,713 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 11:54:32,714 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 11:54:32,715 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated Data race detected The following path leads to a data race: [L685] 0 int s; VAL [s=0] [L696] 0 s = __VERIFIER_nondet_int() VAL [s=0] [L697] 0 pthread_t t; VAL [s=0, t={3:0}] [L698] COND TRUE 0 1 VAL [s=0, t={3:0}] [L698] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [s=0, t={3:0}] [L688] 1 int l = __VERIFIER_nondet_int(); VAL [arg={0:0}, arg={0:0}, l=0, s=0] [L689] 1 l = 4 VAL [arg={0:0}, arg={0:0}, l=4, s=0] [L690] 1 s = l VAL [arg={0:0}, arg={0:0}, l=4, s=4] [L698] COND TRUE 0 1 VAL [s=4, t={3:0}] [L698] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [s=4, t={3:0}] [L688] 2 int l = __VERIFIER_nondet_int(); VAL [arg={0:0}, arg={0:0}, l=4, s=4] [L689] 2 l = 4 VAL [arg={0:0}, arg={0:0}, l=4, s=4] [L690] 2 s = l VAL [arg={0:0}, arg={0:0}, l=4, s=4] Now there is a data race on ~s~0 between C: s = __VERIFIER_nondet_int() [696] and C: s = l [690] - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 83 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 0 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 108 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.8s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 24 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 133 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 171 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 33 mSDtfsCounter, 171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred in iteration=4, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 158 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 291 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 286 IncrementalHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 39 mSDtfsCounter, 286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1114occurred in iteration=5, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 22/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-26 11:54:32,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27898421-750b-4c09-adcd-9356c5d7ff48/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE