./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/38_rand_cas_vs_concur.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/38_rand_cas_vs_concur.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 628ef5ad19754647fb807fc1cc13e384334d380a6e3691b7b5f1842f42e5f662 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:12:25,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:12:25,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:12:25,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:12:25,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:12:25,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:12:25,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:12:25,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:12:25,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:12:25,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:12:25,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:12:25,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:12:25,679 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:12:25,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:12:25,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:12:25,680 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:12:25,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:12:25,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:12:25,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:12:25,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:12:25,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:12:25,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:12:25,681 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:12:25,681 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:12:25,681 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:12:25,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:12:25,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:12:25,681 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:12:25,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:12:25,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:12:25,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:12:25,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:12:25,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:12:25,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:12:25,682 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:12:25,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:12:25,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:12:25,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:12:25,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:12:25,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:12:25,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:12:25,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:12:25,683 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> 628ef5ad19754647fb807fc1cc13e384334d380a6e3691b7b5f1842f42e5f662 [2025-02-08 05:12:25,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:12:25,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:12:25,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:12:25,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:12:25,949 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:12:25,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/38_rand_cas_vs_concur.i [2025-02-08 05:12:27,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92707a21a/9ede4986ad8a48bf81caf4b281e687d6/FLAG9e8e7cf8f [2025-02-08 05:12:27,570 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:12:27,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/38_rand_cas_vs_concur.i [2025-02-08 05:12:27,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92707a21a/9ede4986ad8a48bf81caf4b281e687d6/FLAG9e8e7cf8f [2025-02-08 05:12:27,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92707a21a/9ede4986ad8a48bf81caf4b281e687d6 [2025-02-08 05:12:27,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:12:27,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:12:27,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:12:27,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:12:27,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:12:27,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:12:27" (1/1) ... [2025-02-08 05:12:27,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a2bc46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:27, skipping insertion in model container [2025-02-08 05:12:27,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:12:27" (1/1) ... [2025-02-08 05:12:27,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:12:27,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:12:27,983 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:12:28,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:12:28,067 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:12:28,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:28 WrapperNode [2025-02-08 05:12:28,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:12:28,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:12:28,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:12:28,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:12:28,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:28" (1/1) ... [2025-02-08 05:12:28,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:28" (1/1) ... [2025-02-08 05:12:28,115 INFO L138 Inliner]: procedures = 170, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 116 [2025-02-08 05:12:28,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:12:28,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:12:28,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:12:28,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:12:28,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:28" (1/1) ... [2025-02-08 05:12:28,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:28" (1/1) ... [2025-02-08 05:12:28,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:28" (1/1) ... [2025-02-08 05:12:28,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:28" (1/1) ... [2025-02-08 05:12:28,138 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:28" (1/1) ... [2025-02-08 05:12:28,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:28" (1/1) ... [2025-02-08 05:12:28,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:28" (1/1) ... [2025-02-08 05:12:28,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:28" (1/1) ... [2025-02-08 05:12:28,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:12:28,146 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:12:28,146 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:12:28,146 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:12:28,147 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:28" (1/1) ... [2025-02-08 05:12:28,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:12:28,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:12:28,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:12:28,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:12:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:12:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:12:28,195 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:12:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:12:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:12:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:12:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:12:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:12:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:12:28,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:12:28,196 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:12:28,298 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:12:28,300 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:12:28,557 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715: havoc PseudoRandomUsingAtomic_nex_#t~ret9#1; [2025-02-08 05:12:28,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-1: PseudoRandomUsingAtomic_nex_~nexts~0#1 := PseudoRandomUsingAtomic_nex_#t~ret9#1; [2025-02-08 05:12:28,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-2: assume { :end_inline_nC } true;assume -2147483648 <= PseudoRandomUsingAtomic_nex_#t~ret9#1 && PseudoRandomUsingAtomic_nex_#t~ret9#1 <= 2147483647; [2025-02-08 05:12:28,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-3: havoc nC_#in~s2#1; [2025-02-08 05:12:28,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-4: havoc nC_#t~nondet3#1, nC_~s2#1, nC_~nC_return~0#1; [2025-02-08 05:12:28,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-5: PseudoRandomUsingAtomic_nex_#t~ret9#1 := nC_#res#1; [2025-02-08 05:12:28,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: assume ((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1; [2025-02-08 05:12:28,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: assume !(((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1); [2025-02-08 05:12:28,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: havoc __VERIFIER_atomic_CAS_#t~nondet7#1; [2025-02-08 05:12:28,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-2: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet7#1]; [2025-02-08 05:12:28,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-3: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet7#1]; [2025-02-08 05:12:28,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-4: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet7#1]; [2025-02-08 05:12:28,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-5: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet7#1]; [2025-02-08 05:12:28,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-6: havoc __VERIFIER_atomic_CAS_#t~nondet7#1; [2025-02-08 05:12:28,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-7: SUMMARY for call write~int(0, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset, 4); srcloc: null [2025-02-08 05:12:28,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716: [2025-02-08 05:12:28,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-1: havoc __VERIFIER_atomic_CAS_#in~v#1.base, __VERIFIER_atomic_CAS_#in~v#1.offset, __VERIFIER_atomic_CAS_#in~e#1, __VERIFIER_atomic_CAS_#in~u#1, __VERIFIER_atomic_CAS_#in~r#1.base, __VERIFIER_atomic_CAS_#in~r#1.offset;assume { :end_inline___VERIFIER_atomic_CAS } true; [2025-02-08 05:12:28,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-2: havoc __VERIFIER_atomic_CAS_#t~mem4#1, __VERIFIER_atomic_CAS_#t~nondet5#1, __VERIFIER_atomic_CAS_#t~nondet6#1, __VERIFIER_atomic_CAS_#t~nondet7#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, __VERIFIER_atomic_CAS_~e#1, __VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset; [2025-02-08 05:12:28,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-3: havoc __VERIFIER_atomic_CAS_#t~mem4#1, __VERIFIER_atomic_CAS_#t~nondet5#1, __VERIFIER_atomic_CAS_#t~nondet6#1, __VERIFIER_atomic_CAS_#t~nondet7#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, __VERIFIER_atomic_CAS_~e#1, __VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset; [2025-02-08 05:12:28,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-4: assume { :begin_inline___VERIFIER_atomic_CAS } true;__VERIFIER_atomic_CAS_#in~v#1.base, __VERIFIER_atomic_CAS_#in~v#1.offset, __VERIFIER_atomic_CAS_#in~e#1, __VERIFIER_atomic_CAS_#in~u#1, __VERIFIER_atomic_CAS_#in~r#1.base, __VERIFIER_atomic_CAS_#in~r#1.offset := ~#seed~0.base, ~#seed~0.offset, PseudoRandomUsingAtomic_nex_~nex~0#1, PseudoRandomUsingAtomic_nex_~nexts~0#1, PseudoRandomUsingAtomic_nex_~#casret~0#1.base, PseudoRandomUsingAtomic_nex_~#casret~0#1.offset; [2025-02-08 05:12:28,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: assume 1 == PseudoRandomUsingAtomic_nex_#t~mem10#1; [2025-02-08 05:12:28,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: assume !(1 == PseudoRandomUsingAtomic_nex_#t~mem10#1); [2025-02-08 05:12:28,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: havoc PseudoRandomUsingAtomic_nex_#t~mem10#1; [2025-02-08 05:12:28,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-2: havoc PseudoRandomUsingAtomic_nex_#t~mem10#1; [2025-02-08 05:12:28,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-3: assume ((0 == #race[PseudoRandomUsingAtomic_nex_~#casret~0#1.base,PseudoRandomUsingAtomic_nex_~#casret~0#1.offset] && 0 == #race[PseudoRandomUsingAtomic_nex_~#casret~0#1.base,1 + PseudoRandomUsingAtomic_nex_~#casret~0#1.offset]) && 0 == #race[PseudoRandomUsingAtomic_nex_~#casret~0#1.base,2 + PseudoRandomUsingAtomic_nex_~#casret~0#1.offset]) && 0 == #race[PseudoRandomUsingAtomic_nex_~#casret~0#1.base,3 + PseudoRandomUsingAtomic_nex_~#casret~0#1.offset]; [2025-02-08 05:12:28,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-3: assume !(((0 == #race[PseudoRandomUsingAtomic_nex_~#casret~0#1.base,PseudoRandomUsingAtomic_nex_~#casret~0#1.offset] && 0 == #race[PseudoRandomUsingAtomic_nex_~#casret~0#1.base,1 + PseudoRandomUsingAtomic_nex_~#casret~0#1.offset]) && 0 == #race[PseudoRandomUsingAtomic_nex_~#casret~0#1.base,2 + PseudoRandomUsingAtomic_nex_~#casret~0#1.offset]) && 0 == #race[PseudoRandomUsingAtomic_nex_~#casret~0#1.base,3 + PseudoRandomUsingAtomic_nex_~#casret~0#1.offset]); [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-4: #race := #race[PseudoRandomUsingAtomic_nex_~#casret~0#1.base,3 + PseudoRandomUsingAtomic_nex_~#casret~0#1.offset := 0]; [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-5: #race := #race[PseudoRandomUsingAtomic_nex_~#casret~0#1.base,2 + PseudoRandomUsingAtomic_nex_~#casret~0#1.offset := 0]; [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-6: #race := #race[PseudoRandomUsingAtomic_nex_~#casret~0#1.base,1 + PseudoRandomUsingAtomic_nex_~#casret~0#1.offset := 0]; [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-7: #race := #race[PseudoRandomUsingAtomic_nex_~#casret~0#1.base,PseudoRandomUsingAtomic_nex_~#casret~0#1.offset := 0]; [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-8: SUMMARY for call PseudoRandomUsingAtomic_nex_#t~mem10#1 := read~int(PseudoRandomUsingAtomic_nex_~#casret~0#1.base, PseudoRandomUsingAtomic_nex_~#casret~0#1.offset, 4); srcloc: null [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701: assume __VERIFIER_atomic_CAS_#t~mem4#1 == __VERIFIER_atomic_CAS_~e#1; [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701: assume !(__VERIFIER_atomic_CAS_#t~mem4#1 == __VERIFIER_atomic_CAS_~e#1); [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-1: havoc __VERIFIER_atomic_CAS_#t~mem4#1; [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-2: havoc __VERIFIER_atomic_CAS_#t~mem4#1; [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-3: assume ((0 == #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset]; [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-3: assume !(((0 == #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset]); [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-4: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-5: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-6: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-7: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:12:28,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-8: SUMMARY for call __VERIFIER_atomic_CAS_#t~mem4#1 := read~int(__VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, 4); srcloc: null [2025-02-08 05:12:28,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L718: PseudoRandomUsingAtomic_nex_~nex_return~0#1 := (if 10 >= PseudoRandomUsingAtomic_nex_~nexts~0#1 then PseudoRandomUsingAtomic_nex_~nexts~0#1 else 10); [2025-02-08 05:12:28,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703: havoc __VERIFIER_atomic_CAS_#t~nondet6#1; [2025-02-08 05:12:28,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-1: assume ((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet6#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet6#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet6#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet6#1; [2025-02-08 05:12:28,568 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-1: assume !(((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet6#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet6#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet6#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet6#1); [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-2: havoc __VERIFIER_atomic_CAS_#t~nondet5#1; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-3: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet6#1]; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-4: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet6#1]; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-5: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet6#1]; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-6: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet6#1]; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-7: havoc __VERIFIER_atomic_CAS_#t~nondet6#1; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-8: SUMMARY for call write~int(1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset, 4); srcloc: null [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695: __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#in~r#1.base, __VERIFIER_atomic_CAS_#in~r#1.offset; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-9: assume ((#race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet5#1 && #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet5#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet5#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet5#1; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-9: assume !(((#race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet5#1 && #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet5#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet5#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet5#1); [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695-1: __VERIFIER_atomic_CAS_~u#1 := __VERIFIER_atomic_CAS_#in~u#1; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-10: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet5#1]; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695-2: __VERIFIER_atomic_CAS_~e#1 := __VERIFIER_atomic_CAS_#in~e#1; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-11: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet5#1]; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695-3: __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#in~v#1.base, __VERIFIER_atomic_CAS_#in~v#1.offset; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-12: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet5#1]; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-13: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet5#1]; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-14: havoc __VERIFIER_atomic_CAS_#t~nondet5#1; [2025-02-08 05:12:28,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-15: SUMMARY for call write~int(__VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, 4); srcloc: null [2025-02-08 05:12:28,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: havoc PseudoRandomUsingAtomic_nex_~#casret~0#1.base, PseudoRandomUsingAtomic_nex_~#casret~0#1.offset; [2025-02-08 05:12:28,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-1: SUMMARY for call ULTIMATE.dealloc(PseudoRandomUsingAtomic_nex_~#casret~0#1.base, PseudoRandomUsingAtomic_nex_~#casret~0#1.offset); srcloc: null [2025-02-08 05:12:28,600 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:12:28,600 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:12:28,611 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:12:28,611 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:12:28,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:12:28 BoogieIcfgContainer [2025-02-08 05:12:28,612 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:12:28,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:12:28,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:12:28,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:12:28,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:12:27" (1/3) ... [2025-02-08 05:12:28,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71bd5aa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:12:28, skipping insertion in model container [2025-02-08 05:12:28,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:28" (2/3) ... [2025-02-08 05:12:28,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71bd5aa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:12:28, skipping insertion in model container [2025-02-08 05:12:28,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:12:28" (3/3) ... [2025-02-08 05:12:28,624 INFO L128 eAbstractionObserver]: Analyzing ICFG 38_rand_cas_vs_concur.i [2025-02-08 05:12:28,637 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:12:28,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 38_rand_cas_vs_concur.i that has 2 procedures, 68 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-02-08 05:12:28,639 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:12:28,704 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:28,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 72 transitions, 148 flow [2025-02-08 05:12:28,783 INFO L124 PetriNetUnfolderBase]: 4/79 cut-off events. [2025-02-08 05:12:28,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:12:28,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 79 events. 4/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2025-02-08 05:12:28,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 72 transitions, 148 flow [2025-02-08 05:12:28,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 72 transitions, 148 flow [2025-02-08 05:12:28,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:28,821 INFO L333 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, 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;@5835b7db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:28,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-08 05:12:28,836 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:28,836 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-02-08 05:12:28,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:12:28,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:28,837 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:12:28,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err5ASSERT_VIOLATIONDATA_RACE] === [2025-02-08 05:12:28,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:28,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1708031961, now seen corresponding path program 1 times [2025-02-08 05:12:28,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:28,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875241632] [2025-02-08 05:12:28,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:28,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:28,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:12:28,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:12:28,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:28,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:28,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:12:28,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:12:28,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:12:28,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:28,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:28,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:12:28,982 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:12:28,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-02-08 05:12:28,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 3 remaining) [2025-02-08 05:12:28,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 3 remaining) [2025-02-08 05:12:28,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:12:28,986 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-08 05:12:28,990 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:12:28,990 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:12:29,030 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:29,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 122 transitions, 254 flow [2025-02-08 05:12:29,098 INFO L124 PetriNetUnfolderBase]: 8/138 cut-off events. [2025-02-08 05:12:29,099 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:12:29,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 138 events. 8/138 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 344 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 107. Up to 3 conditions per place. [2025-02-08 05:12:29,103 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 122 transitions, 254 flow [2025-02-08 05:12:29,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 122 transitions, 254 flow [2025-02-08 05:12:29,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:29,109 INFO L333 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, 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;@5835b7db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:29,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 05:12:29,130 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:29,131 INFO L124 PetriNetUnfolderBase]: 0/58 cut-off events. [2025-02-08 05:12:29,131 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:12:29,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:29,131 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:12:29,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-08 05:12:29,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2005206205, now seen corresponding path program 1 times [2025-02-08 05:12:29,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:29,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533277600] [2025-02-08 05:12:29,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:29,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:12:29,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:12:29,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:29,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:29,158 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:12:29,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:12:29,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:12:29,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:29,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:29,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:12:29,182 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:12:29,183 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-08 05:12:29,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (2 of 4 remaining) [2025-02-08 05:12:29,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 4 remaining) [2025-02-08 05:12:29,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2025-02-08 05:12:29,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:12:29,183 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-08 05:12:29,184 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:12:29,184 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:12:29,262 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:29,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 172 transitions, 362 flow [2025-02-08 05:12:29,317 INFO L124 PetriNetUnfolderBase]: 12/197 cut-off events. [2025-02-08 05:12:29,318 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:12:29,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 197 events. 12/197 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 636 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 156. Up to 4 conditions per place. [2025-02-08 05:12:29,322 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 172 transitions, 362 flow [2025-02-08 05:12:29,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 172 transitions, 362 flow [2025-02-08 05:12:29,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:29,327 INFO L333 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, 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;@5835b7db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:29,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 05:12:29,341 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:29,342 INFO L124 PetriNetUnfolderBase]: 0/73 cut-off events. [2025-02-08 05:12:29,342 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:12:29,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:29,342 INFO L206 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] [2025-02-08 05:12:29,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2025-02-08 05:12:29,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:29,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1976364183, now seen corresponding path program 1 times [2025-02-08 05:12:29,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:29,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408842890] [2025-02-08 05:12:29,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:29,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:29,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:12:29,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:12:29,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:29,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:29,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:29,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408842890] [2025-02-08 05:12:29,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408842890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:29,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:29,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:12:29,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874668976] [2025-02-08 05:12:29,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:29,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:12:29,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:29,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:12:29,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:12:30,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 172 [2025-02-08 05:12:30,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 172 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 135.16666666666666) internal successors, (811), 6 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:30,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:30,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 172 [2025-02-08 05:12:30,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:30,630 INFO L124 PetriNetUnfolderBase]: 477/1924 cut-off events. [2025-02-08 05:12:30,631 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2025-02-08 05:12:30,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 1924 events. 477/1924 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 15820 event pairs, 41 based on Foata normal form. 465/2300 useless extension candidates. Maximal degree in co-relation 2176. Up to 456 conditions per place. [2025-02-08 05:12:30,665 INFO L140 encePairwiseOnDemand]: 150/172 looper letters, 45 selfloop transitions, 12 changer transitions 0/143 dead transitions. [2025-02-08 05:12:30,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 143 transitions, 466 flow [2025-02-08 05:12:30,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:12:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:12:30,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 887 transitions. [2025-02-08 05:12:30,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8594961240310077 [2025-02-08 05:12:30,688 INFO L175 Difference]: Start difference. First operand has 167 places, 172 transitions, 362 flow. Second operand 6 states and 887 transitions. [2025-02-08 05:12:30,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 143 transitions, 466 flow [2025-02-08 05:12:30,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 143 transitions, 456 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-02-08 05:12:30,699 INFO L231 Difference]: Finished difference. Result has 118 places, 117 transitions, 319 flow [2025-02-08 05:12:30,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=118, PETRI_TRANSITIONS=117} [2025-02-08 05:12:30,704 INFO L279 CegarLoopForPetriNet]: 167 programPoint places, -49 predicate places. [2025-02-08 05:12:30,704 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 117 transitions, 319 flow [2025-02-08 05:12:30,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.16666666666666) internal successors, (811), 6 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:30,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:30,706 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:12:30,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:12:30,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2025-02-08 05:12:30,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:30,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1984529860, now seen corresponding path program 1 times [2025-02-08 05:12:30,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:30,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143180533] [2025-02-08 05:12:30,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:30,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:12:30,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:12:30,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:30,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:30,726 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:12:30,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:12:30,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:12:30,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:30,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:30,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:12:30,750 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:12:30,750 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-08 05:12:30,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-02-08 05:12:30,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-02-08 05:12:30,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-02-08 05:12:30,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-02-08 05:12:30,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:12:30,750 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 05:12:30,751 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:12:30,751 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:12:30,839 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:30,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 222 transitions, 472 flow [2025-02-08 05:12:30,884 INFO L124 PetriNetUnfolderBase]: 16/256 cut-off events. [2025-02-08 05:12:30,884 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:12:30,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 256 events. 16/256 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 947 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 205. Up to 5 conditions per place. [2025-02-08 05:12:30,888 INFO L82 GeneralOperation]: Start removeDead. Operand has 215 places, 222 transitions, 472 flow [2025-02-08 05:12:30,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 222 transitions, 472 flow [2025-02-08 05:12:30,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:30,894 INFO L333 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, 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;@5835b7db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:30,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 05:12:30,904 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:30,904 INFO L124 PetriNetUnfolderBase]: 0/73 cut-off events. [2025-02-08 05:12:30,905 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:12:30,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:30,905 INFO L206 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] [2025-02-08 05:12:30,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-02-08 05:12:30,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:30,906 INFO L85 PathProgramCache]: Analyzing trace with hash 875099688, now seen corresponding path program 1 times [2025-02-08 05:12:30,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:30,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938385499] [2025-02-08 05:12:30,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:30,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:30,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:12:30,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:12:30,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:30,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:31,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:31,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938385499] [2025-02-08 05:12:31,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938385499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:31,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:31,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:12:31,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998513738] [2025-02-08 05:12:31,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:31,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:12:31,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:31,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:12:31,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:12:31,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 222 [2025-02-08 05:12:31,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 222 transitions, 472 flow. Second operand has 6 states, 6 states have (on average 173.16666666666666) internal successors, (1039), 6 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:31,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:31,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 222 [2025-02-08 05:12:31,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:33,109 INFO L124 PetriNetUnfolderBase]: 4237/13754 cut-off events. [2025-02-08 05:12:33,111 INFO L125 PetriNetUnfolderBase]: For 2401/2401 co-relation queries the response was YES. [2025-02-08 05:12:33,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20189 conditions, 13754 events. 4237/13754 cut-off events. For 2401/2401 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 158939 event pairs, 495 based on Foata normal form. 3144/16288 useless extension candidates. Maximal degree in co-relation 15961. Up to 4160 conditions per place. [2025-02-08 05:12:33,246 INFO L140 encePairwiseOnDemand]: 193/222 looper letters, 61 selfloop transitions, 16 changer transitions 0/186 dead transitions. [2025-02-08 05:12:33,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 186 transitions, 638 flow [2025-02-08 05:12:33,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:12:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:12:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1142 transitions. [2025-02-08 05:12:33,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8573573573573574 [2025-02-08 05:12:33,251 INFO L175 Difference]: Start difference. First operand has 215 places, 222 transitions, 472 flow. Second operand 6 states and 1142 transitions. [2025-02-08 05:12:33,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 186 transitions, 638 flow [2025-02-08 05:12:33,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 186 transitions, 608 flow, removed 15 selfloop flow, removed 0 redundant places. [2025-02-08 05:12:33,260 INFO L231 Difference]: Finished difference. Result has 148 places, 150 transitions, 414 flow [2025-02-08 05:12:33,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=148, PETRI_TRANSITIONS=150} [2025-02-08 05:12:33,262 INFO L279 CegarLoopForPetriNet]: 215 programPoint places, -67 predicate places. [2025-02-08 05:12:33,262 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 150 transitions, 414 flow [2025-02-08 05:12:33,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 173.16666666666666) internal successors, (1039), 6 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:33,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:33,263 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:12:33,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:12:33,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-02-08 05:12:33,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:33,264 INFO L85 PathProgramCache]: Analyzing trace with hash 444308526, now seen corresponding path program 1 times [2025-02-08 05:12:33,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:33,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77530317] [2025-02-08 05:12:33,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:33,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:33,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:12:33,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:12:33,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:33,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:33,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:12:33,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:12:33,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:12:33,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:33,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:33,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:12:33,299 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:12:33,299 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-08 05:12:33,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-02-08 05:12:33,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-02-08 05:12:33,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-02-08 05:12:33,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-02-08 05:12:33,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-02-08 05:12:33,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:12:33,302 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 05:12:33,303 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:12:33,303 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-08 05:12:33,353 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:33,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 272 transitions, 584 flow [2025-02-08 05:12:33,393 INFO L124 PetriNetUnfolderBase]: 20/315 cut-off events. [2025-02-08 05:12:33,394 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-08 05:12:33,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 315 events. 20/315 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1263 event pairs, 0 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 269. Up to 6 conditions per place. [2025-02-08 05:12:33,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 272 transitions, 584 flow [2025-02-08 05:12:33,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 272 transitions, 584 flow [2025-02-08 05:12:33,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:33,403 INFO L333 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, 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;@5835b7db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:33,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 05:12:33,409 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:33,409 INFO L124 PetriNetUnfolderBase]: 0/73 cut-off events. [2025-02-08 05:12:33,409 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:12:33,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:33,410 INFO L206 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] [2025-02-08 05:12:33,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-02-08 05:12:33,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:33,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1733117881, now seen corresponding path program 1 times [2025-02-08 05:12:33,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:33,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076033889] [2025-02-08 05:12:33,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:33,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:33,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:12:33,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:12:33,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:33,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:33,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:33,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076033889] [2025-02-08 05:12:33,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076033889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:33,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:33,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:12:33,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452559217] [2025-02-08 05:12:33,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:33,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:12:33,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:33,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:12:33,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:12:33,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 272 [2025-02-08 05:12:33,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 272 transitions, 584 flow. Second operand has 6 states, 6 states have (on average 211.16666666666666) internal successors, (1267), 6 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:33,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:33,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 272 [2025-02-08 05:12:33,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:41,833 INFO L124 PetriNetUnfolderBase]: 33533/94728 cut-off events. [2025-02-08 05:12:41,833 INFO L125 PetriNetUnfolderBase]: For 21845/21845 co-relation queries the response was YES. [2025-02-08 05:12:42,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142636 conditions, 94728 events. 33533/94728 cut-off events. For 21845/21845 co-relation queries the response was YES. Maximal size of possible extension queue 3628. Compared 1352933 event pairs, 4816 based on Foata normal form. 20780/111521 useless extension candidates. Maximal degree in co-relation 112114. Up to 33760 conditions per place. [2025-02-08 05:12:43,307 INFO L140 encePairwiseOnDemand]: 236/272 looper letters, 77 selfloop transitions, 20 changer transitions 0/229 dead transitions. [2025-02-08 05:12:43,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 229 transitions, 820 flow [2025-02-08 05:12:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:12:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:12:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1397 transitions. [2025-02-08 05:12:43,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8560049019607843 [2025-02-08 05:12:43,319 INFO L175 Difference]: Start difference. First operand has 263 places, 272 transitions, 584 flow. Second operand 6 states and 1397 transitions. [2025-02-08 05:12:43,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 229 transitions, 820 flow [2025-02-08 05:12:43,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 229 transitions, 760 flow, removed 30 selfloop flow, removed 0 redundant places. [2025-02-08 05:12:43,334 INFO L231 Difference]: Finished difference. Result has 178 places, 183 transitions, 509 flow [2025-02-08 05:12:43,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=509, PETRI_PLACES=178, PETRI_TRANSITIONS=183} [2025-02-08 05:12:43,341 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -85 predicate places. [2025-02-08 05:12:43,341 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 183 transitions, 509 flow [2025-02-08 05:12:43,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.16666666666666) internal successors, (1267), 6 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:43,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:43,342 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:12:43,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:12:43,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-02-08 05:12:43,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1316573499, now seen corresponding path program 1 times [2025-02-08 05:12:43,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:43,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112923632] [2025-02-08 05:12:43,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:43,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:43,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:12:43,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:12:43,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:43,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:43,368 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:12:43,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:12:43,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:12:43,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:43,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:43,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:12:43,396 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:12:43,396 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-08 05:12:43,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-02-08 05:12:43,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-02-08 05:12:43,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-02-08 05:12:43,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-02-08 05:12:43,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-02-08 05:12:43,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-02-08 05:12:43,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:12:43,397 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 05:12:43,398 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:12:43,398 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-02-08 05:12:43,466 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:43,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 322 transitions, 698 flow [2025-02-08 05:12:43,534 INFO L124 PetriNetUnfolderBase]: 24/374 cut-off events. [2025-02-08 05:12:43,534 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-08 05:12:43,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 374 events. 24/374 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1572 event pairs, 0 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 334. Up to 7 conditions per place. [2025-02-08 05:12:43,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 311 places, 322 transitions, 698 flow [2025-02-08 05:12:43,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 322 transitions, 698 flow [2025-02-08 05:12:43,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:43,544 INFO L333 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, 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;@5835b7db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:43,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 05:12:43,549 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:43,550 INFO L124 PetriNetUnfolderBase]: 0/73 cut-off events. [2025-02-08 05:12:43,550 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:12:43,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:43,550 INFO L206 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] [2025-02-08 05:12:43,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-02-08 05:12:43,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash 341010922, now seen corresponding path program 1 times [2025-02-08 05:12:43,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:43,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425759917] [2025-02-08 05:12:43,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:43,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:12:43,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:12:43,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:43,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:43,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:43,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425759917] [2025-02-08 05:12:43,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425759917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:43,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:43,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:12:43,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480010664] [2025-02-08 05:12:43,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:43,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:12:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:43,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:12:43,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:12:43,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 322 [2025-02-08 05:12:43,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 322 transitions, 698 flow. Second operand has 6 states, 6 states have (on average 249.16666666666666) internal successors, (1495), 6 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:43,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:43,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 322 [2025-02-08 05:12:43,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand