/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:38:40,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:38:40,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:38:40,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:38:40,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:38:40,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:38:40,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:38:40,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:38:40,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:38:40,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:38:40,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:38:40,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:38:40,446 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:38:40,446 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:38:40,447 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:38:40,447 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:38:40,447 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:38:40,447 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:38:40,447 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:38:40,447 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:38:40,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:38:40,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:38:40,448 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:38:40,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:38:40,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:38:40,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:38:40,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:38:40,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:38:40,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:38:40,449 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:38:40,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:38:40,449 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:38:40,449 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:38:40,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:38:40,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:38:40,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:38:40,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:38:40,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:38:40,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:38:40,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:38:40,449 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:38:40,449 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:38:40,449 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:38:40,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:38:40,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:38:40,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:38:40,692 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:38:40,692 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:38:40,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2025-04-26 16:38:42,011 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b4ef4f81f/bacc695643764c9bb67fd88118f486b3/FLAG49da88155 [2025-04-26 16:38:42,213 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:38:42,214 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2025-04-26 16:38:42,221 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b4ef4f81f/bacc695643764c9bb67fd88118f486b3/FLAG49da88155 [2025-04-26 16:38:43,057 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b4ef4f81f/bacc695643764c9bb67fd88118f486b3 [2025-04-26 16:38:43,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:38:43,060 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:38:43,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:38:43,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:38:43,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:38:43,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:38:43" (1/1) ... [2025-04-26 16:38:43,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2495abfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:38:43, skipping insertion in model container [2025-04-26 16:38:43,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:38:43" (1/1) ... [2025-04-26 16:38:43,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:38:43,258 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c[2092,2105] [2025-04-26 16:38:43,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:38:43,271 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:38:43,295 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c[2092,2105] [2025-04-26 16:38:43,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:38:43,306 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:38:43,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:38:43 WrapperNode [2025-04-26 16:38:43,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:38:43,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:38:43,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:38:43,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:38:43,312 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:38:43" (1/1) ... [2025-04-26 16:38:43,318 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:38:43" (1/1) ... [2025-04-26 16:38:43,330 INFO L138 Inliner]: procedures = 18, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-04-26 16:38:43,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:38:43,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:38:43,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:38:43,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:38:43,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:38:43" (1/1) ... [2025-04-26 16:38:43,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:38:43" (1/1) ... [2025-04-26 16:38:43,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:38:43" (1/1) ... [2025-04-26 16:38:43,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:38:43" (1/1) ... [2025-04-26 16:38:43,341 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:38:43" (1/1) ... [2025-04-26 16:38:43,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:38:43" (1/1) ... [2025-04-26 16:38:43,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:38:43" (1/1) ... [2025-04-26 16:38:43,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:38:43" (1/1) ... [2025-04-26 16:38:43,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:38:43" (1/1) ... [2025-04-26 16:38:43,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:38:43,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:38:43,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:38:43,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:38:43,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:38:43" (1/1) ... [2025-04-26 16:38:43,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:38:43,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:38:43,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:38:43,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:38:43,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:38:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:38:43,392 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:38:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:38:43,392 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:38:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:38:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:38:43,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:38:43,393 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:38:43,456 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:38:43,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:38:43,577 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:38:43,578 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:38:43,593 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:38:43,593 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:38:43,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:38:43 BoogieIcfgContainer [2025-04-26 16:38:43,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:38:43,594 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:38:43,594 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:38:43,599 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:38:43,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:38:43,600 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 04:38:43" (1/3) ... [2025-04-26 16:38:43,601 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d71fd83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:38:43, skipping insertion in model container [2025-04-26 16:38:43,601 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:38:43,601 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:38:43" (2/3) ... [2025-04-26 16:38:43,601 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d71fd83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:38:43, skipping insertion in model container [2025-04-26 16:38:43,601 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:38:43,601 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:38:43" (3/3) ... [2025-04-26 16:38:43,602 INFO L376 chiAutomizerObserver]: Analyzing ICFG parallel-misc-3.wvr.c [2025-04-26 16:38:43,672 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:38:43,707 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:38:43,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:38:43,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:38:43,710 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:38:43,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:38:43,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 91 transitions, 196 flow [2025-04-26 16:38:43,809 INFO L116 PetriNetUnfolderBase]: 9/87 cut-off events. [2025-04-26 16:38:43,810 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:38:43,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 87 events. 9/87 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 114 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 51. Up to 4 conditions per place. [2025-04-26 16:38:43,817 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 91 transitions, 196 flow [2025-04-26 16:38:43,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 87 transitions, 186 flow [2025-04-26 16:38:43,820 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 85 places, 87 transitions, 186 flow [2025-04-26 16:38:43,825 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:38:44,015 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 860#[L60, L42, L86-5]true [2025-04-26 16:38:44,057 WARN L140 AmpleReduction]: Number of pruned transitions: 686 [2025-04-26 16:38:44,057 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:38:44,057 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 25 [2025-04-26 16:38:44,057 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:90 [2025-04-26 16:38:44,057 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:455 [2025-04-26 16:38:44,057 WARN L145 AmpleReduction]: Times succ was already a loop node:19 [2025-04-26 16:38:44,057 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:131 [2025-04-26 16:38:44,058 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:38:44,063 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 570 states, 568 states have (on average 1.3679577464788732) internal successors, (in total 777), 569 states have internal predecessors, (777), 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:38:44,069 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:38:44,070 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:38:44,070 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:38:44,070 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:38:44,072 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:38:44,072 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:38:44,072 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:38:44,072 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:38:44,076 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 570 states, 568 states have (on average 1.3679577464788732) internal successors, (in total 777), 569 states have internal predecessors, (777), 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:38:44,101 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 472 [2025-04-26 16:38:44,101 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:38:44,101 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:38:44,109 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] [2025-04-26 16:38:44,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:38:44,109 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:38:44,110 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 570 states, 568 states have (on average 1.3679577464788732) internal successors, (in total 777), 569 states have internal predecessors, (777), 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:38:44,121 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 472 [2025-04-26 16:38:44,122 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:38:44,122 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:38:44,122 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] [2025-04-26 16:38:44,122 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:38:44,126 INFO L752 eck$LassoCheckResult]: Stem: "[165] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[172] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[164] L21-->L21-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[]" "[188] L21-1-->L21-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[]" "[182] L21-2-->L21-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[]" "[147] L21-3-->L21-4: Formula: (and (= 22 (select |v_#length_2| 2)) (= (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[]" "[210] L21-4-->L37: Formula: (= v_~pos~0_9 0) InVars {} OutVars{~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~pos~0]" "[197] L37-->L37-1: Formula: (= v_~d1~0_7 0) InVars {} OutVars{~d1~0=v_~d1~0_7} AuxVars[] AssignedVars[~d1~0]" "[198] L37-1-->L37-2: Formula: (= v_~d2~0_7 0) InVars {} OutVars{~d2~0=v_~d2~0_7} AuxVars[] AssignedVars[~d2~0]" "[148] L37-2-->L37-3: Formula: (= v_~g1~0_4 0) InVars {} OutVars{~g1~0=v_~g1~0_4} AuxVars[] AssignedVars[~g1~0]" "[166] L37-3-->L-1-1: Formula: (= v_~g2~0_4 0) InVars {} OutVars{~g2~0=v_~g2~0_4} AuxVars[] AssignedVars[~g2~0]" "[201] 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]" "[202] L-1-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~t2~0#1]" "[214] L76-->L76-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]" "[185] L76-1-->L79: 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]" "[191] L79-->L80: Formula: (= v_~d1~0_8 1) InVars {} OutVars{~d1~0=v_~d1~0_8} AuxVars[] AssignedVars[~d1~0]" "[141] L80-->L81: Formula: (= v_~d2~0_8 1) InVars {} OutVars{~d2~0=v_~d2~0_8} AuxVars[] AssignedVars[~d2~0]" "[196] L81-->L82: Formula: (= v_~g1~0_5 1) InVars {} OutVars{~g1~0=v_~g1~0_5} AuxVars[] AssignedVars[~g1~0]" "[154] L82-->L85: Formula: (= v_~g2~0_5 1) InVars {} OutVars{~g2~0=v_~g2~0_5} AuxVars[] AssignedVars[~g2~0]" "[170] L85-->L85-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1]" "[190] L85-1-->L85-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[133] L85-2-->L85-3: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[258] L85-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre5#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= |v_thread1Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= |v_thread1Thread1of1ForFork0_#in~_argptr.base_4| 0) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_7|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_7|, thread1Thread1of1ForFork0_#in~_argptr.base=|v_thread1Thread1of1ForFork0_#in~_argptr.base_4|, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_14|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_~_argptr.base=v_thread1Thread1of1ForFork0_~_argptr.base_4, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_6|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#in~_argptr.offset=|v_thread1Thread1of1ForFork0_#in~_argptr.offset_4|, thread1Thread1of1ForFork0_~_argptr.offset=v_thread1Thread1of1ForFork0_~_argptr.offset_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#in~_argptr.base, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~_argptr.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#in~_argptr.offset, thread1Thread1of1ForFork0_~_argptr.offset]" "[216] $Ultimate##0-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_~_argptr.offset_1 |v_thread1Thread1of1ForFork0_#in~_argptr.offset_1|) (= |v_thread1Thread1of1ForFork0_#in~_argptr.base_1| v_thread1Thread1of1ForFork0_~_argptr.base_1)) InVars {thread1Thread1of1ForFork0_#in~_argptr.base=|v_thread1Thread1of1ForFork0_#in~_argptr.base_1|, thread1Thread1of1ForFork0_#in~_argptr.offset=|v_thread1Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread1Thread1of1ForFork0_#in~_argptr.base=|v_thread1Thread1of1ForFork0_#in~_argptr.base_1|, thread1Thread1of1ForFork0_#in~_argptr.offset=|v_thread1Thread1of1ForFork0_#in~_argptr.offset_1|, thread1Thread1of1ForFork0_~_argptr.base=v_thread1Thread1of1ForFork0_~_argptr.base_1, thread1Thread1of1ForFork0_~_argptr.offset=v_thread1Thread1of1ForFork0_~_argptr.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~_argptr.base, thread1Thread1of1ForFork0_~_argptr.offset]" [2025-04-26 16:38:44,127 INFO L754 eck$LassoCheckResult]: Loop: "[218] L47-1-->L41: Formula: (not (= (mod v_~g1~0_1 256) 0)) InVars {~g1~0=v_~g1~0_1} OutVars{~g1~0=v_~g1~0_1} AuxVars[] AssignedVars[]" "[221] L41-->L44: Formula: (= 0 (mod v_~d1~0_3 256)) InVars {~d1~0=v_~d1~0_3} OutVars{~d1~0=v_~d1~0_3} AuxVars[] AssignedVars[]" "[224] L44-->L44-2: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~post2_1| v_~pos~0_12) (= |v_thread1Thread1of1ForFork0_#t~post2_1| (+ v_~pos~0_11 1))) InVars {~pos~0=v_~pos~0_12} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0]" "[226] L44-2-->L41-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2]" "[227] L41-2-->L47: Formula: (= v_~d1~0_4 (ite (= (ite (= (mod v_~d1~0_5 256) 0) 1 0) 0) 0 1)) InVars {~d1~0=v_~d1~0_5} OutVars{~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[~d1~0]" "[229] L47-->L47-1: Formula: (= (mod v_~d1~0_1 256) 0) InVars {~d1~0=v_~d1~0_1} OutVars{~d1~0=v_~d1~0_1} AuxVars[] AssignedVars[]" [2025-04-26 16:38:44,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:38:44,135 INFO L85 PathProgramCache]: Analyzing trace with hash -294855113, now seen corresponding path program 1 times [2025-04-26 16:38:44,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:38:44,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243874142] [2025-04-26 16:38:44,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:38:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:38:44,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:38:44,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:38:44,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:38:44,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:38:44,203 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:38:44,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:38:44,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:38:44,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:38:44,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:38:44,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:38:44,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:38:44,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1250280216, now seen corresponding path program 1 times [2025-04-26 16:38:44,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:38:44,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629505491] [2025-04-26 16:38:44,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:38:44,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:38:44,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:38:44,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:38:44,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:38:44,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:38:44,383 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:38:44,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:38:44,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629505491] [2025-04-26 16:38:44,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629505491] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:38:44,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:38:44,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:38:44,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382597747] [2025-04-26 16:38:44,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:38:44,387 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:38:44,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:38:44,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:38:44,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:38:44,403 INFO L87 Difference]: Start difference. First operand has 570 states, 568 states have (on average 1.3679577464788732) internal successors, (in total 777), 569 states have internal predecessors, (777), 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) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (in total 6), 4 states have internal predecessors, (6), 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:38:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:38:44,483 INFO L93 Difference]: Finished difference Result 795 states and 1027 transitions. [2025-04-26 16:38:44,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 795 states and 1027 transitions. [2025-04-26 16:38:44,489 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 637 [2025-04-26 16:38:44,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 795 states to 717 states and 919 transitions. [2025-04-26 16:38:44,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 717 [2025-04-26 16:38:44,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 717 [2025-04-26 16:38:44,503 INFO L74 IsDeterministic]: Start isDeterministic. Operand 717 states and 919 transitions. [2025-04-26 16:38:44,507 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:38:44,507 INFO L218 hiAutomatonCegarLoop]: Abstraction has 717 states and 919 transitions. [2025-04-26 16:38:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states and 919 transitions. [2025-04-26 16:38:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 607. [2025-04-26 16:38:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 607 states have (on average 1.2833607907742999) internal successors, (in total 779), 606 states have internal predecessors, (779), 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:38:44,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 779 transitions. [2025-04-26 16:38:44,559 INFO L240 hiAutomatonCegarLoop]: Abstraction has 607 states and 779 transitions. [2025-04-26 16:38:44,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:38:44,563 INFO L438 stractBuchiCegarLoop]: Abstraction has 607 states and 779 transitions. [2025-04-26 16:38:44,563 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:38:44,563 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 607 states and 779 transitions. [2025-04-26 16:38:44,568 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 553 [2025-04-26 16:38:44,568 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:38:44,568 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:38:44,569 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] [2025-04-26 16:38:44,569 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:38:44,570 INFO L752 eck$LassoCheckResult]: Stem: "[165] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[172] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[164] L21-->L21-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[]" "[188] L21-1-->L21-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[]" "[182] L21-2-->L21-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[]" "[147] L21-3-->L21-4: Formula: (and (= 22 (select |v_#length_2| 2)) (= (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[]" "[210] L21-4-->L37: Formula: (= v_~pos~0_9 0) InVars {} OutVars{~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~pos~0]" "[197] L37-->L37-1: Formula: (= v_~d1~0_7 0) InVars {} OutVars{~d1~0=v_~d1~0_7} AuxVars[] AssignedVars[~d1~0]" "[198] L37-1-->L37-2: Formula: (= v_~d2~0_7 0) InVars {} OutVars{~d2~0=v_~d2~0_7} AuxVars[] AssignedVars[~d2~0]" "[148] L37-2-->L37-3: Formula: (= v_~g1~0_4 0) InVars {} OutVars{~g1~0=v_~g1~0_4} AuxVars[] AssignedVars[~g1~0]" "[166] L37-3-->L-1-1: Formula: (= v_~g2~0_4 0) InVars {} OutVars{~g2~0=v_~g2~0_4} AuxVars[] AssignedVars[~g2~0]" "[201] 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]" "[202] L-1-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~t2~0#1]" "[214] L76-->L76-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]" "[185] L76-1-->L79: 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]" "[191] L79-->L80: Formula: (= v_~d1~0_8 1) InVars {} OutVars{~d1~0=v_~d1~0_8} AuxVars[] AssignedVars[~d1~0]" "[141] L80-->L81: Formula: (= v_~d2~0_8 1) InVars {} OutVars{~d2~0=v_~d2~0_8} AuxVars[] AssignedVars[~d2~0]" "[196] L81-->L82: Formula: (= v_~g1~0_5 1) InVars {} OutVars{~g1~0=v_~g1~0_5} AuxVars[] AssignedVars[~g1~0]" "[154] L82-->L85: Formula: (= v_~g2~0_5 1) InVars {} OutVars{~g2~0=v_~g2~0_5} AuxVars[] AssignedVars[~g2~0]" "[170] L85-->L85-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1]" "[190] L85-1-->L85-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[133] L85-2-->L85-3: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[258] L85-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre5#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= |v_thread1Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= |v_thread1Thread1of1ForFork0_#in~_argptr.base_4| 0) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_7|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_7|, thread1Thread1of1ForFork0_#in~_argptr.base=|v_thread1Thread1of1ForFork0_#in~_argptr.base_4|, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_14|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_~_argptr.base=v_thread1Thread1of1ForFork0_~_argptr.base_4, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_6|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#in~_argptr.offset=|v_thread1Thread1of1ForFork0_#in~_argptr.offset_4|, thread1Thread1of1ForFork0_~_argptr.offset=v_thread1Thread1of1ForFork0_~_argptr.offset_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#in~_argptr.base, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~_argptr.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#in~_argptr.offset, thread1Thread1of1ForFork0_~_argptr.offset]" "[216] $Ultimate##0-->L47-1: Formula: (and (= v_thread1Thread1of1ForFork0_~_argptr.offset_1 |v_thread1Thread1of1ForFork0_#in~_argptr.offset_1|) (= |v_thread1Thread1of1ForFork0_#in~_argptr.base_1| v_thread1Thread1of1ForFork0_~_argptr.base_1)) InVars {thread1Thread1of1ForFork0_#in~_argptr.base=|v_thread1Thread1of1ForFork0_#in~_argptr.base_1|, thread1Thread1of1ForFork0_#in~_argptr.offset=|v_thread1Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread1Thread1of1ForFork0_#in~_argptr.base=|v_thread1Thread1of1ForFork0_#in~_argptr.base_1|, thread1Thread1of1ForFork0_#in~_argptr.offset=|v_thread1Thread1of1ForFork0_#in~_argptr.offset_1|, thread1Thread1of1ForFork0_~_argptr.base=v_thread1Thread1of1ForFork0_~_argptr.base_1, thread1Thread1of1ForFork0_~_argptr.offset=v_thread1Thread1of1ForFork0_~_argptr.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~_argptr.base, thread1Thread1of1ForFork0_~_argptr.offset]" [2025-04-26 16:38:44,571 INFO L754 eck$LassoCheckResult]: Loop: "[218] L47-1-->L41: Formula: (not (= (mod v_~g1~0_1 256) 0)) InVars {~g1~0=v_~g1~0_1} OutVars{~g1~0=v_~g1~0_1} AuxVars[] AssignedVars[]" "[220] L41-->L42: Formula: (not (= (mod v_~d1~0_2 256) 0)) InVars {~d1~0=v_~d1~0_2} OutVars{~d1~0=v_~d1~0_2} AuxVars[] AssignedVars[]" "[223] L42-->L42-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_#t~post1_1| 1) v_~pos~0_15) (= |v_thread1Thread1of1ForFork0_#t~post1_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~pos~0]" "[225] L42-2-->L41-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1]" "[227] L41-2-->L47: Formula: (= v_~d1~0_4 (ite (= (ite (= (mod v_~d1~0_5 256) 0) 1 0) 0) 0 1)) InVars {~d1~0=v_~d1~0_5} OutVars{~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[~d1~0]" "[229] L47-->L47-1: Formula: (= (mod v_~d1~0_1 256) 0) InVars {~d1~0=v_~d1~0_1} OutVars{~d1~0=v_~d1~0_1} AuxVars[] AssignedVars[]" "[218] L47-1-->L41: Formula: (not (= (mod v_~g1~0_1 256) 0)) InVars {~g1~0=v_~g1~0_1} OutVars{~g1~0=v_~g1~0_1} AuxVars[] AssignedVars[]" "[221] L41-->L44: Formula: (= 0 (mod v_~d1~0_3 256)) InVars {~d1~0=v_~d1~0_3} OutVars{~d1~0=v_~d1~0_3} AuxVars[] AssignedVars[]" "[224] L44-->L44-2: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~post2_1| v_~pos~0_12) (= |v_thread1Thread1of1ForFork0_#t~post2_1| (+ v_~pos~0_11 1))) InVars {~pos~0=v_~pos~0_12} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0]" "[226] L44-2-->L41-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2]" "[227] L41-2-->L47: Formula: (= v_~d1~0_4 (ite (= (ite (= (mod v_~d1~0_5 256) 0) 1 0) 0) 0 1)) InVars {~d1~0=v_~d1~0_5} OutVars{~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[~d1~0]" "[228] L47-->L48: Formula: (not (= (mod v_~d1~0_6 256) 0)) InVars {~d1~0=v_~d1~0_6} OutVars{~d1~0=v_~d1~0_6} AuxVars[] AssignedVars[]" "[230] L48-->L48-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet3]" "[231] L48-1-->L48-2: Formula: (or (= |v_thread1Thread1of1ForFork0_#t~nondet3_3| 0) (= |v_thread1Thread1of1ForFork0_#t~nondet3_3| 1)) InVars {thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_3|} OutVars{thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[]" "[233] L48-2-->L48-5: Formula: (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_7| 256) 0) InVars {thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_7|} OutVars{thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_7|} AuxVars[] AssignedVars[]" "[235] L48-5-->L47-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet3]" [2025-04-26 16:38:44,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:38:44,572 INFO L85 PathProgramCache]: Analyzing trace with hash -294855113, now seen corresponding path program 2 times [2025-04-26 16:38:44,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:38:44,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333565241] [2025-04-26 16:38:44,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:38:44,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:38:44,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:38:44,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:38:44,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:38:44,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:38:44,586 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:38:44,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:38:44,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:38:44,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:38:44,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:38:44,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:38:44,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:38:44,605 INFO L85 PathProgramCache]: Analyzing trace with hash 840944848, now seen corresponding path program 1 times [2025-04-26 16:38:44,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:38:44,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447879299] [2025-04-26 16:38:44,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:38:44,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:38:44,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:38:44,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:38:44,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:38:44,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:38:44,615 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:38:44,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:38:44,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:38:44,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:38:44,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:38:44,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:38:44,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:38:44,626 INFO L85 PathProgramCache]: Analyzing trace with hash 451247878, now seen corresponding path program 1 times [2025-04-26 16:38:44,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:38:44,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062626654] [2025-04-26 16:38:44,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:38:44,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:38:44,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 16:38:44,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 16:38:44,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:38:44,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:38:44,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:38:44,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 16:38:44,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 16:38:44,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:38:44,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:38:44,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:38:44,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:38:44,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:38:44,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:38:44,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:38:44,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:38:45,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:38:45,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:38:45,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:38:45,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:38:45,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:38:45,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:38:45 BoogieIcfgContainer [2025-04-26 16:38:45,087 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:38:45,088 INFO L158 Benchmark]: Toolchain (without parser) took 2027.98ms. Allocated memory is still 155.2MB. Free memory was 110.8MB in the beginning and 118.9MB in the end (delta: -8.1MB). Peak memory consumption was 78.1MB. Max. memory is 8.0GB. [2025-04-26 16:38:45,088 INFO L158 Benchmark]: CDTParser took 0.17ms. 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:38:45,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.19ms. Allocated memory is still 155.2MB. Free memory was 110.8MB in the beginning and 97.1MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:38:45,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.49ms. Allocated memory is still 155.2MB. Free memory was 97.1MB in the beginning and 96.3MB in the end (delta: 801.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:38:45,092 INFO L158 Benchmark]: Boogie Preprocessor took 16.19ms. Allocated memory is still 155.2MB. Free memory was 96.3MB in the beginning and 95.3MB in the end (delta: 996.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:38:45,094 INFO L158 Benchmark]: RCFGBuilder took 246.11ms. Allocated memory is still 155.2MB. Free memory was 95.3MB in the beginning and 81.9MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-26 16:38:45,094 INFO L158 Benchmark]: BuchiAutomizer took 1493.42ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 118.9MB in the end (delta: -37.1MB). Peak memory consumption was 48.7MB. Max. memory is 8.0GB. [2025-04-26 16:38:45,095 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.17ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.19ms. Allocated memory is still 155.2MB. Free memory was 110.8MB in the beginning and 97.1MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.49ms. Allocated memory is still 155.2MB. Free memory was 97.1MB in the beginning and 96.3MB in the end (delta: 801.7kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 16.19ms. Allocated memory is still 155.2MB. Free memory was 96.3MB in the beginning and 95.3MB in the end (delta: 996.3kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 246.11ms. Allocated memory is still 155.2MB. Free memory was 95.3MB in the beginning and 81.9MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 1493.42ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 118.9MB in the end (delta: -37.1MB). Peak memory consumption was 48.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 2 iterations. TraceHistogramMax:2. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 110 StatesRemovedByMinimization, 1 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, 109 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 221 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 108 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 354, Number of transitions in reduction automaton: 777, Number of states in reduction automaton: 570, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 607 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 40]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L36] 0 _Atomic int pos; VAL [pos=0] [L37] 0 _Bool d1, d2, g1, g2; VAL [d1=0, d2=0, g1=0, g2=0, pos=0] [L76] 0 pthread_t t1, t2; VAL [d1=0, d2=0, g1=0, g2=0, pos=0] [L79] 0 d1 = 1 VAL [d1=1, d2=0, g1=0, g2=0, pos=0] [L80] 0 d2 = 1 VAL [d1=1, d2=1, g1=0, g2=0, pos=0] [L81] 0 g1 = 1 VAL [d1=1, d2=1, g1=1, g2=0, pos=0] [L82] 0 g2 = 1 VAL [d1=1, d2=1, g1=1, g2=1, pos=0] [L85] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\at(_argptr, Pre)={0:0}, d1=1, d2=1, g1=1, g2=1, pos=0, t1=0] Loop: [L40] COND TRUE \read(g1) [L41] COND TRUE \read(d1) [L42] pos++ [L46] d1 = !d1 [L47] COND FALSE !(\read(d1)) [L40] COND TRUE \read(g1) [L41] COND FALSE !(\read(d1)) [L44] pos-- [L46] d1 = !d1 [L47] COND TRUE \read(d1) [L48] COND FALSE !(__VERIFIER_nondet_bool()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 40]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L36] 0 _Atomic int pos; VAL [pos=0] [L37] 0 _Bool d1, d2, g1, g2; VAL [d1=0, d2=0, g1=0, g2=0, pos=0] [L76] 0 pthread_t t1, t2; VAL [d1=0, d2=0, g1=0, g2=0, pos=0] [L79] 0 d1 = 1 VAL [d1=1, d2=0, g1=0, g2=0, pos=0] [L80] 0 d2 = 1 VAL [d1=1, d2=1, g1=0, g2=0, pos=0] [L81] 0 g1 = 1 VAL [d1=1, d2=1, g1=1, g2=0, pos=0] [L82] 0 g2 = 1 VAL [d1=1, d2=1, g1=1, g2=1, pos=0] [L85] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\at(_argptr, Pre)={0:0}, d1=1, d2=1, g1=1, g2=1, pos=0, t1=0] Loop: [L40] COND TRUE \read(g1) [L41] COND TRUE \read(d1) [L42] pos++ [L46] d1 = !d1 [L47] COND FALSE !(\read(d1)) [L40] COND TRUE \read(g1) [L41] COND FALSE !(\read(d1)) [L44] pos-- [L46] d1 = !d1 [L47] COND TRUE \read(d1) [L48] COND FALSE !(__VERIFIER_nondet_bool()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:38:45,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...