/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/peterson.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:02:24,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:02:24,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:02:24,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:02:24,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:02:24,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:02:24,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:02:24,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:02:24,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:02:24,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:02:24,222 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:02:24,222 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:02:24,222 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:02:24,222 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:02:24,222 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:02:24,223 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:02:24,223 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:02:24,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:02:24,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:02:24,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:02:24,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:02:24,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:02:24,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:02:24,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:02:24,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:02:24,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:02:24,223 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:02:24,223 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:02:24,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:02:24,223 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:02:24,223 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:02:24,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:02:24,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:02:24,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:02:24,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:02:24,224 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:02:24,224 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:02:24,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:02:24,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:02:24,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:02:24,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:02:24,442 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:02:24,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-atomic/peterson.i [2025-04-26 16:02:25,694 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/91c0cfa12/7c540320a8064846b97860cc1165edf0/FLAG8a53b28f7 [2025-04-26 16:02:25,708 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-04-26 16:02:25,943 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:02:25,943 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i [2025-04-26 16:02:25,959 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/91c0cfa12/7c540320a8064846b97860cc1165edf0/FLAG8a53b28f7 [2025-04-26 16:02:26,745 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/91c0cfa12/7c540320a8064846b97860cc1165edf0 [2025-04-26 16:02:26,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:02:26,748 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:02:26,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:02:26,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:02:26,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:02:26,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:02:26" (1/1) ... [2025-04-26 16:02:26,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1321e55d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:26, skipping insertion in model container [2025-04-26 16:02:26,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:02:26" (1/1) ... [2025-04-26 16:02:26,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:02:27,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:02:27,074 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:02:27,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:02:27,160 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:02:27,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:27 WrapperNode [2025-04-26 16:02:27,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:02:27,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:02:27,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:02:27,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:02:27,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:27" (1/1) ... [2025-04-26 16:02:27,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:27" (1/1) ... [2025-04-26 16:02:27,195 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-04-26 16:02:27,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:02:27,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:02:27,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:02:27,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:02:27,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:27" (1/1) ... [2025-04-26 16:02:27,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:27" (1/1) ... [2025-04-26 16:02:27,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:27" (1/1) ... [2025-04-26 16:02:27,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:27" (1/1) ... [2025-04-26 16:02:27,205 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:27" (1/1) ... [2025-04-26 16:02:27,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:27" (1/1) ... [2025-04-26 16:02:27,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:27" (1/1) ... [2025-04-26 16:02:27,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:27" (1/1) ... [2025-04-26 16:02:27,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:27" (1/1) ... [2025-04-26 16:02:27,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:02:27,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:02:27,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:02:27,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:02:27,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:27" (1/1) ... [2025-04-26 16:02:27,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:02:27,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:02:27,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:02:27,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:02:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-04-26 16:02:27,265 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-04-26 16:02:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-26 16:02:27,265 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-26 16:02:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:02:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:02:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:02:27,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:02:27,266 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:02:27,361 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:02:27,363 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:02:27,451 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:02:27,451 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:02:27,457 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:02:27,457 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:02:27,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:02:27 BoogieIcfgContainer [2025-04-26 16:02:27,457 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:02:27,458 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:02:27,458 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:02:27,462 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:02:27,462 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:02:27,462 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 04:02:26" (1/3) ... [2025-04-26 16:02:27,463 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1aa00d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:02:27, skipping insertion in model container [2025-04-26 16:02:27,463 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:02:27,463 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:27" (2/3) ... [2025-04-26 16:02:27,463 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1aa00d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:02:27, skipping insertion in model container [2025-04-26 16:02:27,463 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:02:27,463 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:02:27" (3/3) ... [2025-04-26 16:02:27,466 INFO L376 chiAutomizerObserver]: Analyzing ICFG peterson.i [2025-04-26 16:02:27,516 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:02:27,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 68 transitions, 150 flow [2025-04-26 16:02:27,578 INFO L116 PetriNetUnfolderBase]: 6/64 cut-off events. [2025-04-26 16:02:27,580 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:02:27,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 6/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-04-26 16:02:27,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 68 transitions, 150 flow [2025-04-26 16:02:27,586 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 64 transitions, 140 flow [2025-04-26 16:02:27,586 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 65 places, 64 transitions, 140 flow [2025-04-26 16:02:27,595 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:02:27,595 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:02:27,595 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:02:27,595 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:02:27,595 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:02:27,595 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:02:27,595 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:02:27,596 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:02:27,597 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:02:27,732 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 88 [2025-04-26 16:02:27,732 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:02:27,732 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:02:27,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:02:27,738 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:02:27,738 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:02:27,738 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 708 states, but on-demand construction may add more states [2025-04-26 16:02:27,758 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 88 [2025-04-26 16:02:27,758 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:02:27,758 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:02:27,758 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:02:27,758 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:02:27,762 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[129] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[99] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[124] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[122] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[134] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 11) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[131] L12-4-->L731: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0]" "[117] L731-->L732: Formula: (= v_~flag2~0_5 0) InVars {} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[~flag2~0]" "[110] L732-->L733: Formula: (= v_~turn~0_7 0) InVars {} OutVars{~turn~0=v_~turn~0_7} AuxVars[] AssignedVars[~turn~0]" "[116] L733-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[139] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[142] L-1-2-->L753: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~t2~0#1]" "[148] L753-->L753-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[126] L753-1-->L754: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[93] L754-->L754-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[96] L754-1-->L754-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[151] L754-2-->L754-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[193] L754-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_6|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~_#1.base]" "[172] $Ultimate##0-->L735: Formula: (and (= |v_thr1Thread1of1ForFork1_~_#1.offset_1| |v_thr1Thread1of1ForFork1_#in~_#1.offset_1|) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_1| |v_thr1Thread1of1ForFork1_~_#1.base_1|)) InVars {thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_~_#1.base]" "[173] L735-->L735-1: Formula: (= v_~flag1~0_4 1) InVars {} OutVars{~flag1~0=v_~flag1~0_4} AuxVars[] AssignedVars[~flag1~0]" "[174] L735-1-->L737: Formula: (= v_~turn~0_6 1) InVars {} OutVars{~turn~0=v_~turn~0_6} AuxVars[] AssignedVars[~turn~0]" [2025-04-26 16:02:27,763 INFO L754 eck$LassoCheckResult]: Loop: "[176] L737-->L737: Formula: (and (= v_~turn~0_4 1) (= v_~flag2~0_3 1)) InVars {~turn~0=v_~turn~0_4, ~flag2~0=v_~flag2~0_3} OutVars{~turn~0=v_~turn~0_4, ~flag2~0=v_~flag2~0_3} AuxVars[] AssignedVars[]" [2025-04-26 16:02:27,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:27,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1806928950, now seen corresponding path program 1 times [2025-04-26 16:02:27,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:27,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522559763] [2025-04-26 16:02:27,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:27,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:27,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:02:27,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:02:27,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:27,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:27,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:27,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:02:27,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:02:27,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:27,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:27,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:27,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:27,885 INFO L85 PathProgramCache]: Analyzing trace with hash 207, now seen corresponding path program 1 times [2025-04-26 16:02:27,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:27,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76263411] [2025-04-26 16:02:27,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:27,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:27,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:02:27,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:02:27,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:27,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:27,901 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:27,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:02:27,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:02:27,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:27,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:27,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:27,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:27,925 INFO L85 PathProgramCache]: Analyzing trace with hash -180222426, now seen corresponding path program 1 times [2025-04-26 16:02:27,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:27,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585701877] [2025-04-26 16:02:27,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:27,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:27,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:02:27,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:02:27,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:27,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:02:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:02:28,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:02:28,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585701877] [2025-04-26 16:02:28,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585701877] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:02:28,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:02:28,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:02:28,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604844054] [2025-04-26 16:02:28,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:02:28,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:02:28,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:02:28,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:02:28,114 INFO L87 Difference]: Start difference. First operand currently 708 states, but on-demand construction may add more states Second operand has 3 states, 2 states have (on average 11.0) internal successors, (in total 22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:02:28,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:02:28,150 INFO L93 Difference]: Finished difference Result 621 states and 1536 transitions. [2025-04-26 16:02:28,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 621 states and 1536 transitions. [2025-04-26 16:02:28,156 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 61 [2025-04-26 16:02:28,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 621 states to 328 states and 778 transitions. [2025-04-26 16:02:28,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 328 [2025-04-26 16:02:28,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 328 [2025-04-26 16:02:28,164 INFO L74 IsDeterministic]: Start isDeterministic. Operand 328 states and 778 transitions. [2025-04-26 16:02:28,169 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:02:28,169 INFO L218 hiAutomatonCegarLoop]: Abstraction has 328 states and 778 transitions. [2025-04-26 16:02:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states and 778 transitions. [2025-04-26 16:02:28,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-04-26 16:02:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 328 states have (on average 2.3719512195121952) internal successors, (in total 778), 327 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:02:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 778 transitions. [2025-04-26 16:02:28,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 328 states and 778 transitions. [2025-04-26 16:02:28,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:02:28,207 INFO L438 stractBuchiCegarLoop]: Abstraction has 328 states and 778 transitions. [2025-04-26 16:02:28,207 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:02:28,207 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 328 states and 778 transitions. [2025-04-26 16:02:28,209 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 61 [2025-04-26 16:02:28,209 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:02:28,209 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:02:28,209 INFO L148 hiAutomatonCegarLoop]: Counterexample stem 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] [2025-04-26 16:02:28,209 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:02:28,210 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[129] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[99] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[124] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[122] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[134] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 11) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[131] L12-4-->L731: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0]" "[117] L731-->L732: Formula: (= v_~flag2~0_5 0) InVars {} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[~flag2~0]" "[110] L732-->L733: Formula: (= v_~turn~0_7 0) InVars {} OutVars{~turn~0=v_~turn~0_7} AuxVars[] AssignedVars[~turn~0]" "[116] L733-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[139] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[142] L-1-2-->L753: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~t2~0#1]" "[148] L753-->L753-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[126] L753-1-->L754: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[93] L754-->L754-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[96] L754-1-->L754-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[151] L754-2-->L754-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[193] L754-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_6|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~_#1.base]" "[104] L754-4-->L754-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[120] L754-5-->L755: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[109] L755-->L755-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[152] L755-1-->L755-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[137] L755-2-->L755-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre11#1_3|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[190] L755-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.offset_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thr2Thread1of1ForFork0_#res#1.offset=|v_thr2Thread1of1ForFork0_#res#1.offset_4|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_4|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_6|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_4|, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_4|, thr2Thread1of1ForFork0_#res#1.base=|v_thr2Thread1of1ForFork0_#res#1.base_4|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork0_#res#1.offset, thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_#in~_#1.base, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~_#1.offset, thr2Thread1of1ForFork0_#res#1.base, thr2Thread1of1ForFork0_#in~_#1.offset]" "[156] $Ultimate##0-->L744: Formula: (and (= |v_thr2Thread1of1ForFork0_~_#1.base_1| |v_thr2Thread1of1ForFork0_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork0_~_#1.offset_1| |v_thr2Thread1of1ForFork0_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_1|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_1|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~_#1.offset]" "[157] L744-->L744-1: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" "[158] L744-1-->L746: Formula: (= v_~turn~0_1 0) InVars {} OutVars{~turn~0=v_~turn~0_1} AuxVars[] AssignedVars[~turn~0]" [2025-04-26 16:02:28,210 INFO L754 eck$LassoCheckResult]: Loop: "[160] L746-->L746: Formula: (and (= v_~turn~0_2 0) (= v_~flag1~0_1 1)) InVars {~turn~0=v_~turn~0_2, ~flag1~0=v_~flag1~0_1} OutVars{~turn~0=v_~turn~0_2, ~flag1~0=v_~flag1~0_1} AuxVars[] AssignedVars[]" [2025-04-26 16:02:28,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:28,211 INFO L85 PathProgramCache]: Analyzing trace with hash 244846730, now seen corresponding path program 1 times [2025-04-26 16:02:28,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:28,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846440090] [2025-04-26 16:02:28,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:28,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:02:28,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:02:28,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:28,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:28,225 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:28,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:02:28,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:02:28,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:28,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:28,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:28,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash 191, now seen corresponding path program 1 times [2025-04-26 16:02:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:28,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467625281] [2025-04-26 16:02:28,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:28,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:28,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:02:28,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:02:28,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:28,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:28,242 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:28,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:02:28,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:02:28,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:28,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:28,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:28,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:28,244 INFO L85 PathProgramCache]: Analyzing trace with hash -999685802, now seen corresponding path program 1 times [2025-04-26 16:02:28,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:28,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400668133] [2025-04-26 16:02:28,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:28,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:28,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:02:28,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:02:28,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:28,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:02:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:02:28,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:02:28,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400668133] [2025-04-26 16:02:28,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400668133] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:02:28,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:02:28,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:02:28,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279090886] [2025-04-26 16:02:28,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:02:28,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:02:28,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:02:28,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:02:28,330 INFO L87 Difference]: Start difference. First operand 328 states and 778 transitions. cyclomatic complexity: 511 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (in total 28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:02:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:02:28,348 INFO L93 Difference]: Finished difference Result 328 states and 762 transitions. [2025-04-26 16:02:28,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 328 states and 762 transitions. [2025-04-26 16:02:28,351 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 45 [2025-04-26 16:02:28,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 328 states to 270 states and 632 transitions. [2025-04-26 16:02:28,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2025-04-26 16:02:28,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2025-04-26 16:02:28,354 INFO L74 IsDeterministic]: Start isDeterministic. Operand 270 states and 632 transitions. [2025-04-26 16:02:28,354 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:02:28,355 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 632 transitions. [2025-04-26 16:02:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 632 transitions. [2025-04-26 16:02:28,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-04-26 16:02:28,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 2.3407407407407406) internal successors, (in total 632), 269 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:02:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 632 transitions. [2025-04-26 16:02:28,366 INFO L240 hiAutomatonCegarLoop]: Abstraction has 270 states and 632 transitions. [2025-04-26 16:02:28,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:02:28,366 INFO L438 stractBuchiCegarLoop]: Abstraction has 270 states and 632 transitions. [2025-04-26 16:02:28,366 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:02:28,367 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 632 transitions. [2025-04-26 16:02:28,368 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 45 [2025-04-26 16:02:28,368 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:02:28,368 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:02:28,368 INFO L148 hiAutomatonCegarLoop]: Counterexample stem 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] [2025-04-26 16:02:28,368 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:02:28,369 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[129] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[99] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[124] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[122] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[134] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 11) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[131] L12-4-->L731: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0]" "[117] L731-->L732: Formula: (= v_~flag2~0_5 0) InVars {} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[~flag2~0]" "[110] L732-->L733: Formula: (= v_~turn~0_7 0) InVars {} OutVars{~turn~0=v_~turn~0_7} AuxVars[] AssignedVars[~turn~0]" "[116] L733-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[139] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[142] L-1-2-->L753: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~t2~0#1]" "[148] L753-->L753-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[126] L753-1-->L754: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[93] L754-->L754-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[96] L754-1-->L754-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[151] L754-2-->L754-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[193] L754-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_6|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~_#1.base]" "[104] L754-4-->L754-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[120] L754-5-->L755: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[172] $Ultimate##0-->L735: Formula: (and (= |v_thr1Thread1of1ForFork1_~_#1.offset_1| |v_thr1Thread1of1ForFork1_#in~_#1.offset_1|) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_1| |v_thr1Thread1of1ForFork1_~_#1.base_1|)) InVars {thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_~_#1.base]" "[109] L755-->L755-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[152] L755-1-->L755-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[137] L755-2-->L755-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre11#1_3|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[173] L735-->L735-1: Formula: (= v_~flag1~0_4 1) InVars {} OutVars{~flag1~0=v_~flag1~0_4} AuxVars[] AssignedVars[~flag1~0]" "[174] L735-1-->L737: Formula: (= v_~turn~0_6 1) InVars {} OutVars{~turn~0=v_~turn~0_6} AuxVars[] AssignedVars[~turn~0]" "[190] L755-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.offset_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thr2Thread1of1ForFork0_#res#1.offset=|v_thr2Thread1of1ForFork0_#res#1.offset_4|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_4|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_6|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_4|, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_4|, thr2Thread1of1ForFork0_#res#1.base=|v_thr2Thread1of1ForFork0_#res#1.base_4|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork0_#res#1.offset, thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_#in~_#1.base, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~_#1.offset, thr2Thread1of1ForFork0_#res#1.base, thr2Thread1of1ForFork0_#in~_#1.offset]" "[156] $Ultimate##0-->L744: Formula: (and (= |v_thr2Thread1of1ForFork0_~_#1.base_1| |v_thr2Thread1of1ForFork0_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork0_~_#1.offset_1| |v_thr2Thread1of1ForFork0_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_1|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_1|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~_#1.offset]" "[157] L744-->L744-1: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" [2025-04-26 16:02:28,369 INFO L754 eck$LassoCheckResult]: Loop: "[176] L737-->L737: Formula: (and (= v_~turn~0_4 1) (= v_~flag2~0_3 1)) InVars {~turn~0=v_~turn~0_4, ~flag2~0=v_~flag2~0_3} OutVars{~turn~0=v_~turn~0_4, ~flag2~0=v_~flag2~0_3} AuxVars[] AssignedVars[]" [2025-04-26 16:02:28,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:28,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1830857927, now seen corresponding path program 1 times [2025-04-26 16:02:28,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:28,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084927730] [2025-04-26 16:02:28,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:28,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:28,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:02:28,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:02:28,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:28,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:28,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:28,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:02:28,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:02:28,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:28,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:28,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:28,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:28,388 INFO L85 PathProgramCache]: Analyzing trace with hash 207, now seen corresponding path program 2 times [2025-04-26 16:02:28,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:28,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790633487] [2025-04-26 16:02:28,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:02:28,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:28,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:02:28,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:02:28,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:02:28,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:28,392 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:28,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:02:28,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:02:28,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:28,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:28,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:28,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:28,395 INFO L85 PathProgramCache]: Analyzing trace with hash -922020713, now seen corresponding path program 1 times [2025-04-26 16:02:28,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:28,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252897842] [2025-04-26 16:02:28,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:28,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:28,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 16:02:28,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:02:28,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:28,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:28,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:28,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 16:02:28,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:02:28,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:28,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:28,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:28,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:02:28,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:02:28,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:28,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:28,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:28,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:02:28,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:02:28,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:28,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:28,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:02:28 BoogieIcfgContainer [2025-04-26 16:02:28,875 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:02:28,875 INFO L158 Benchmark]: Toolchain (without parser) took 2127.10ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 58.7MB in the end (delta: 38.8MB). Peak memory consumption was 38.2MB. Max. memory is 8.0GB. [2025-04-26 16:02:28,875 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:02:28,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.92ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 76.2MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-26 16:02:28,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.84ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 74.0MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:02:28,878 INFO L158 Benchmark]: Boogie Preprocessor took 17.30ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 73.3MB in the end (delta: 659.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:02:28,878 INFO L158 Benchmark]: RCFGBuilder took 243.82ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 60.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:02:28,878 INFO L158 Benchmark]: BuchiAutomizer took 1416.95ms. Allocated memory is still 142.6MB. Free memory was 60.7MB in the beginning and 58.7MB in the end (delta: 2.1MB). Peak memory consumption was 401.6kB. Max. memory is 8.0GB. [2025-04-26 16:02:28,879 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 409.92ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 76.2MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.84ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 74.0MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.30ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 73.3MB in the end (delta: 659.7kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 243.82ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 60.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1416.95ms. Allocated memory is still 142.6MB. Free memory was 60.7MB in the beginning and 58.7MB in the end (delta: 2.1MB). Peak memory consumption was 401.6kB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 99 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 270 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 737]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L731] 0 atomic_int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L732] 0 atomic_int turn; VAL [flag1=0, flag2=0, turn=0] [L733] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L753] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, turn=0, x=0] [L754] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, t1=-1, turn=0, x=0] [L735] 1 flag1 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L736] 1 turn = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, turn=1, x=0] [L755] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=1, flag2=0, t1=-1, t2=0, turn=1, x=0] [L744] 2 flag2 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=1, turn=1, x=0] Loop: [L737] COND TRUE flag2==1 && turn==1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 737]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L731] 0 atomic_int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L732] 0 atomic_int turn; VAL [flag1=0, flag2=0, turn=0] [L733] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L753] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, turn=0, x=0] [L754] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, t1=-1, turn=0, x=0] [L735] 1 flag1 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L736] 1 turn = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, turn=1, x=0] [L755] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=1, flag2=0, t1=-1, t2=0, turn=1, x=0] [L744] 2 flag2 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=1, turn=1, x=0] Loop: [L737] COND TRUE flag2==1 && turn==1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:02:28,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...