/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-extended.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:26:34,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:26:34,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:26:34,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:26:34,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:26:34,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:26:34,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:26:34,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:26:34,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:26:34,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:26:34,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:26:34,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:26:34,432 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:26:34,432 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:26:34,432 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:26:34,432 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:26:34,432 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:26:34,433 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:26:34,433 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:26:34,433 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:26:34,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:26:34,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:26:34,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:26:34,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:26:34,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:26:34,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:26:34,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:26:34,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:26:34,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:26:34,433 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:26:34,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:26:34,433 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:26:34,433 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:26:34,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:26:34,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:26:34,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:26:34,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:26:34,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:26:34,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:26:34,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:26:34,434 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:26:34,434 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:26:34,434 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:26:34,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:26:34,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:26:34,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:26:34,636 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 18:26:34,636 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 18:26:34,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2025-04-26 18:26:35,934 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/85d256c29/e1f25437f3524ba697377604108ce43d/FLAGd61cacc73 [2025-04-26 18:26:36,146 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 18:26:36,147 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2025-04-26 18:26:36,160 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/85d256c29/e1f25437f3524ba697377604108ce43d/FLAGd61cacc73 [2025-04-26 18:26:36,984 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/85d256c29/e1f25437f3524ba697377604108ce43d [2025-04-26 18:26:36,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:26:36,987 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 18:26:36,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 18:26:36,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 18:26:36,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 18:26:36,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:26:36" (1/1) ... [2025-04-26 18:26:36,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294a500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:36, skipping insertion in model container [2025-04-26 18:26:36,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:26:36" (1/1) ... [2025-04-26 18:26:37,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 18:26:37,142 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-extended.wvr.c[2421,2434] [2025-04-26 18:26:37,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:26:37,160 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 18:26:37,179 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-extended.wvr.c[2421,2434] [2025-04-26 18:26:37,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:26:37,191 INFO L204 MainTranslator]: Completed translation [2025-04-26 18:26:37,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:37 WrapperNode [2025-04-26 18:26:37,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 18:26:37,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:26:37,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:26:37,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:26:37,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:37" (1/1) ... [2025-04-26 18:26:37,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:37" (1/1) ... [2025-04-26 18:26:37,224 INFO L138 Inliner]: procedures = 19, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2025-04-26 18:26:37,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:26:37,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:26:37,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:26:37,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:26:37,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:37" (1/1) ... [2025-04-26 18:26:37,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:37" (1/1) ... [2025-04-26 18:26:37,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:37" (1/1) ... [2025-04-26 18:26:37,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:37" (1/1) ... [2025-04-26 18:26:37,237 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:37" (1/1) ... [2025-04-26 18:26:37,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:37" (1/1) ... [2025-04-26 18:26:37,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:37" (1/1) ... [2025-04-26 18:26:37,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:37" (1/1) ... [2025-04-26 18:26:37,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:37" (1/1) ... [2025-04-26 18:26:37,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:26:37,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:26:37,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:26:37,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:26:37,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:37" (1/1) ... [2025-04-26 18:26:37,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:26:37,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:37,282 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 18:26:37,288 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 18:26:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 18:26:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:26:37,307 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:26:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:26:37,307 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:26:37,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:26:37,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:26:37,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 18:26:37,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:26:37,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:26:37,309 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 18:26:37,379 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:26:37,380 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:26:37,527 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:26:37,527 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:26:37,543 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:26:37,543 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:26:37,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:26:37 BoogieIcfgContainer [2025-04-26 18:26:37,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:26:37,544 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:26:37,544 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:26:37,549 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:26:37,549 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:26:37,549 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 06:26:36" (1/3) ... [2025-04-26 18:26:37,550 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@320d188f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:26:37, skipping insertion in model container [2025-04-26 18:26:37,550 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:26:37,550 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:26:37" (2/3) ... [2025-04-26 18:26:37,550 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@320d188f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:26:37, skipping insertion in model container [2025-04-26 18:26:37,550 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:26:37,551 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:26:37" (3/3) ... [2025-04-26 18:26:37,551 INFO L376 chiAutomizerObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2025-04-26 18:26:37,638 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:26:37,676 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:26:37,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:26:37,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:26:37,681 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 18:26:37,682 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 18:26:37,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 124 transitions, 269 flow [2025-04-26 18:26:37,784 INFO L116 PetriNetUnfolderBase]: 13/118 cut-off events. [2025-04-26 18:26:37,787 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:26:37,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 118 events. 13/118 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. [2025-04-26 18:26:37,791 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 124 transitions, 269 flow [2025-04-26 18:26:37,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 118 transitions, 254 flow [2025-04-26 18:26:37,795 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 115 places, 118 transitions, 254 flow [2025-04-26 18:26:37,796 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 118 transitions, 254 flow [2025-04-26 18:26:38,314 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15974 states, 15972 states have (on average 4.078888054094666) internal successors, (in total 65148), 15973 states have internal predecessors, (65148), 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 18:26:38,356 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 15974 states, 15972 states have (on average 4.078888054094666) internal successors, (in total 65148), 15973 states have internal predecessors, (65148), 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 18:26:38,359 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:26:38,680 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8951#[L78, L42, L107-5, thread2EXIT]true [2025-04-26 18:26:38,787 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8869#[L42, L107-5, thread3EXIT, L62]true [2025-04-26 18:26:38,857 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 7299#[L78, L42, L107-5, L62]true [2025-04-26 18:26:38,936 WARN L140 AmpleReduction]: Number of pruned transitions: 7117 [2025-04-26 18:26:38,936 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 3 [2025-04-26 18:26:38,936 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 224 [2025-04-26 18:26:38,936 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:152 [2025-04-26 18:26:38,936 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:3276 [2025-04-26 18:26:38,936 WARN L145 AmpleReduction]: Times succ was already a loop node:141 [2025-04-26 18:26:38,937 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:1032 [2025-04-26 18:26:38,937 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:26:38,950 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 3650 states, 3648 states have (on average 1.4616228070175439) internal successors, (in total 5332), 3649 states have internal predecessors, (5332), 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 18:26:38,966 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:26:38,966 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:26:38,966 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:26:38,969 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:26:38,970 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:26:38,970 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:26:38,970 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:26:38,970 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:26:38,991 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3650 states, 3648 states have (on average 1.4616228070175439) internal successors, (in total 5332), 3649 states have internal predecessors, (5332), 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 18:26:39,093 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 3239 [2025-04-26 18:26:39,094 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:26:39,094 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:26:39,100 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 18:26:39,100 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:26:39,100 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:26:39,104 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3650 states, 3648 states have (on average 1.4616228070175439) internal successors, (in total 5332), 3649 states have internal predecessors, (5332), 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 18:26:39,139 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 3239 [2025-04-26 18:26:39,139 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:26:39,139 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:26:39,140 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 18:26:39,140 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:26:39,147 INFO L752 eck$LassoCheckResult]: Stem: "[202] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[208] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[256] 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[]" "[272] 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[]" "[217] 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[]" "[250] L21-3-->L21-4: Formula: (and (= 31 (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[]" "[234] L21-4-->L37: Formula: (= v_~pos~0_14 0) InVars {} OutVars{~pos~0=v_~pos~0_14} AuxVars[] AssignedVars[~pos~0]" "[226] L37-->L37-1: Formula: (= v_~d1~0_8 0) InVars {} OutVars{~d1~0=v_~d1~0_8} AuxVars[] AssignedVars[~d1~0]" "[227] L37-1-->L37-2: Formula: (= v_~d2~0_8 0) InVars {} OutVars{~d2~0=v_~d2~0_8} AuxVars[] AssignedVars[~d2~0]" "[194] L37-2-->L37-3: Formula: (= v_~d3~0_8 0) InVars {} OutVars{~d3~0=v_~d3~0_8} AuxVars[] AssignedVars[~d3~0]" "[204] L37-3-->L37-4: Formula: (= v_~g1~0_5 0) InVars {} OutVars{~g1~0=v_~g1~0_5} AuxVars[] AssignedVars[~g1~0]" "[267] L37-4-->L37-5: Formula: (= v_~g2~0_5 0) InVars {} OutVars{~g2~0=v_~g2~0_5} AuxVars[] AssignedVars[~g2~0]" "[247] L37-5-->L-1-1: Formula: (= v_~g3~0_5 0) InVars {} OutVars{~g3~0=v_~g3~0_5} AuxVars[] AssignedVars[~g3~0]" "[282] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[286] L-1-2-->L94: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_5|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_5|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_5|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~t2~0#1]" "[274] L94-->L94-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[246] L94-1-->L94-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[261] L94-2-->L97: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[244] L97-->L98: Formula: (= v_~d1~0_7 1) InVars {} OutVars{~d1~0=v_~d1~0_7} AuxVars[] AssignedVars[~d1~0]" "[259] L98-->L99: Formula: (= v_~d2~0_7 1) InVars {} OutVars{~d2~0=v_~d2~0_7} AuxVars[] AssignedVars[~d2~0]" "[265] L99-->L100: Formula: (= v_~d3~0_7 1) InVars {} OutVars{~d3~0=v_~d3~0_7} AuxVars[] AssignedVars[~d3~0]" "[225] L100-->L101: Formula: (= v_~g1~0_4 1) InVars {} OutVars{~g1~0=v_~g1~0_4} AuxVars[] AssignedVars[~g1~0]" "[276] L101-->L102: Formula: (= v_~g2~0_4 1) InVars {} OutVars{~g2~0=v_~g2~0_4} AuxVars[] AssignedVars[~g2~0]" "[212] L102-->L105: Formula: (= v_~g3~0_4 1) InVars {} OutVars{~g3~0=v_~g3~0_4} AuxVars[] AssignedVars[~g3~0]" "[195] L105-->L105-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1]" "[229] L105-1-->L105-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[210] L105-2-->L105-3: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_ULTIMATE.start_main_~t1~0#1_1|) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[358] L105-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thread1Thread1of1ForFork1_thidvar0_2) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{thread1Thread1of1ForFork1_#t~nondet3=|v_thread1Thread1of1ForFork1_#t~nondet3_14|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_6|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_6|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet3, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[294] $Ultimate##0-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_1| v_thread1Thread1of1ForFork1_~_argptr.base_1) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_1| v_thread1Thread1of1ForFork1_~_argptr.offset_1)) InVars {thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_1, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_1, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_~_argptr.offset]" [2025-04-26 18:26:39,147 INFO L754 eck$LassoCheckResult]: Loop: "[296] 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[]" "[299] 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[]" "[302] L44-->L44-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0]" "[304] L44-2-->L41-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[305] 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]" "[307] 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 18:26:39,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:26:39,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1311100459, now seen corresponding path program 1 times [2025-04-26 18:26:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:26:39,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421043022] [2025-04-26 18:26:39,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:26:39,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:26:39,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:26:39,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:26:39,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:39,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:39,226 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:26:39,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:26:39,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:26:39,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:39,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:39,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:26:39,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:26:39,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1057229352, now seen corresponding path program 1 times [2025-04-26 18:26:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:26:39,264 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531526880] [2025-04-26 18:26:39,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:26:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:26:39,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:26:39,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:26:39,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:39,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:26:39,436 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 18:26:39,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:26:39,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531526880] [2025-04-26 18:26:39,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531526880] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:26:39,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:26:39,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:26:39,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116134778] [2025-04-26 18:26:39,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:26:39,441 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 18:26:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:26:39,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:26:39,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:26:39,462 INFO L87 Difference]: Start difference. First operand has 3650 states, 3648 states have (on average 1.4616228070175439) internal successors, (in total 5332), 3649 states have internal predecessors, (5332), 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 18:26:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:26:39,598 INFO L93 Difference]: Finished difference Result 5763 states and 8263 transitions. [2025-04-26 18:26:39,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5763 states and 8263 transitions. [2025-04-26 18:26:39,650 INFO L131 ngComponentsAnalysis]: Automaton has 157 accepting balls. 5053 [2025-04-26 18:26:39,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5763 states to 5575 states and 7967 transitions. [2025-04-26 18:26:39,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5575 [2025-04-26 18:26:39,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5575 [2025-04-26 18:26:39,706 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5575 states and 7967 transitions. [2025-04-26 18:26:39,728 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:26:39,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5575 states and 7967 transitions. [2025-04-26 18:26:39,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5575 states and 7967 transitions. [2025-04-26 18:26:39,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5575 to 3803. [2025-04-26 18:26:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3803 states, 3803 states have (on average 1.409413620825664) internal successors, (in total 5360), 3802 states have internal predecessors, (5360), 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 18:26:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3803 states to 3803 states and 5360 transitions. [2025-04-26 18:26:39,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3803 states and 5360 transitions. [2025-04-26 18:26:39,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:26:39,870 INFO L438 stractBuchiCegarLoop]: Abstraction has 3803 states and 5360 transitions. [2025-04-26 18:26:39,871 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:26:39,871 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3803 states and 5360 transitions. [2025-04-26 18:26:39,886 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 3469 [2025-04-26 18:26:39,886 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:26:39,886 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:26:39,887 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 18:26:39,887 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:26:39,887 INFO L752 eck$LassoCheckResult]: Stem: "[202] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[208] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[256] 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[]" "[272] 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[]" "[217] 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[]" "[250] L21-3-->L21-4: Formula: (and (= 31 (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[]" "[234] L21-4-->L37: Formula: (= v_~pos~0_14 0) InVars {} OutVars{~pos~0=v_~pos~0_14} AuxVars[] AssignedVars[~pos~0]" "[226] L37-->L37-1: Formula: (= v_~d1~0_8 0) InVars {} OutVars{~d1~0=v_~d1~0_8} AuxVars[] AssignedVars[~d1~0]" "[227] L37-1-->L37-2: Formula: (= v_~d2~0_8 0) InVars {} OutVars{~d2~0=v_~d2~0_8} AuxVars[] AssignedVars[~d2~0]" "[194] L37-2-->L37-3: Formula: (= v_~d3~0_8 0) InVars {} OutVars{~d3~0=v_~d3~0_8} AuxVars[] AssignedVars[~d3~0]" "[204] L37-3-->L37-4: Formula: (= v_~g1~0_5 0) InVars {} OutVars{~g1~0=v_~g1~0_5} AuxVars[] AssignedVars[~g1~0]" "[267] L37-4-->L37-5: Formula: (= v_~g2~0_5 0) InVars {} OutVars{~g2~0=v_~g2~0_5} AuxVars[] AssignedVars[~g2~0]" "[247] L37-5-->L-1-1: Formula: (= v_~g3~0_5 0) InVars {} OutVars{~g3~0=v_~g3~0_5} AuxVars[] AssignedVars[~g3~0]" "[282] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[286] L-1-2-->L94: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_5|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_5|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_5|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~t2~0#1]" "[274] L94-->L94-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[246] L94-1-->L94-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[261] L94-2-->L97: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[244] L97-->L98: Formula: (= v_~d1~0_7 1) InVars {} OutVars{~d1~0=v_~d1~0_7} AuxVars[] AssignedVars[~d1~0]" "[259] L98-->L99: Formula: (= v_~d2~0_7 1) InVars {} OutVars{~d2~0=v_~d2~0_7} AuxVars[] AssignedVars[~d2~0]" "[265] L99-->L100: Formula: (= v_~d3~0_7 1) InVars {} OutVars{~d3~0=v_~d3~0_7} AuxVars[] AssignedVars[~d3~0]" "[225] L100-->L101: Formula: (= v_~g1~0_4 1) InVars {} OutVars{~g1~0=v_~g1~0_4} AuxVars[] AssignedVars[~g1~0]" "[276] L101-->L102: Formula: (= v_~g2~0_4 1) InVars {} OutVars{~g2~0=v_~g2~0_4} AuxVars[] AssignedVars[~g2~0]" "[212] L102-->L105: Formula: (= v_~g3~0_4 1) InVars {} OutVars{~g3~0=v_~g3~0_4} AuxVars[] AssignedVars[~g3~0]" "[195] L105-->L105-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1]" "[229] L105-1-->L105-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[210] L105-2-->L105-3: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_ULTIMATE.start_main_~t1~0#1_1|) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[358] L105-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thread1Thread1of1ForFork1_thidvar0_2) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{thread1Thread1of1ForFork1_#t~nondet3=|v_thread1Thread1of1ForFork1_#t~nondet3_14|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_6|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_6|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet3, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[294] $Ultimate##0-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_1| v_thread1Thread1of1ForFork1_~_argptr.base_1) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_1| v_thread1Thread1of1ForFork1_~_argptr.offset_1)) InVars {thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_1, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_1, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_~_argptr.offset]" [2025-04-26 18:26:39,888 INFO L754 eck$LassoCheckResult]: Loop: "[296] 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[]" "[298] 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[]" "[301] L42-->L42-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_19) (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_20)) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0]" "[303] L42-2-->L41-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[305] 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]" "[307] 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[]" "[296] 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[]" "[299] 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[]" "[302] L44-->L44-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0]" "[304] L44-2-->L41-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2]" "[305] 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]" "[306] 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[]" "[308] L48-->L48-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet3=|v_thread1Thread1of1ForFork1_#t~nondet3_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet3]" "[309] L48-1-->L48-2: Formula: (or (= |v_thread1Thread1of1ForFork1_#t~nondet3_3| 0) (= |v_thread1Thread1of1ForFork1_#t~nondet3_3| 1)) InVars {thread1Thread1of1ForFork1_#t~nondet3=|v_thread1Thread1of1ForFork1_#t~nondet3_3|} OutVars{thread1Thread1of1ForFork1_#t~nondet3=|v_thread1Thread1of1ForFork1_#t~nondet3_3|} AuxVars[] AssignedVars[]" "[311] L48-2-->L48-5: Formula: (= (mod |v_thread1Thread1of1ForFork1_#t~nondet3_7| 256) 0) InVars {thread1Thread1of1ForFork1_#t~nondet3=|v_thread1Thread1of1ForFork1_#t~nondet3_7|} OutVars{thread1Thread1of1ForFork1_#t~nondet3=|v_thread1Thread1of1ForFork1_#t~nondet3_7|} AuxVars[] AssignedVars[]" "[313] L48-5-->L47-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet3=|v_thread1Thread1of1ForFork1_#t~nondet3_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet3]" [2025-04-26 18:26:39,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:26:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1311100459, now seen corresponding path program 2 times [2025-04-26 18:26:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:26:39,888 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497493802] [2025-04-26 18:26:39,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:26:39,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:26:39,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:26:39,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:26:39,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:26:39,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:39,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:26:39,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:26:39,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:26:39,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:39,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:39,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:26:39,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:26:39,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1782569680, now seen corresponding path program 1 times [2025-04-26 18:26:39,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:26:39,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089407038] [2025-04-26 18:26:39,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:26:39,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:26:39,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:26:39,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:26:39,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:39,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:39,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:26:39,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:26:39,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:26:39,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:39,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:39,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:26:39,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:26:39,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2017715364, now seen corresponding path program 1 times [2025-04-26 18:26:39,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:26:39,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021138497] [2025-04-26 18:26:39,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:26:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:26:39,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-26 18:26:39,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-26 18:26:39,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:39,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:39,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:26:39,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-26 18:26:39,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-26 18:26:39,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:39,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:39,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:26:40,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:26:40,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:26:40,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:40,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:40,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:26:40,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:26:40,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:26:40,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:26:40,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:26:40,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:26:40,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:26:40 BoogieIcfgContainer [2025-04-26 18:26:40,475 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:26:40,476 INFO L158 Benchmark]: Toolchain (without parser) took 3488.14ms. Allocated memory was 155.2MB in the beginning and 281.0MB in the end (delta: 125.8MB). Free memory was 111.2MB in the beginning and 153.2MB in the end (delta: -42.0MB). Peak memory consumption was 80.2MB. Max. memory is 8.0GB. [2025-04-26 18:26:40,476 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:26:40,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.93ms. Allocated memory is still 155.2MB. Free memory was 111.2MB in the beginning and 96.8MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:26:40,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.60ms. Allocated memory is still 155.2MB. Free memory was 96.8MB in the beginning and 95.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:26:40,476 INFO L158 Benchmark]: Boogie Preprocessor took 30.00ms. Allocated memory is still 155.2MB. Free memory was 95.3MB in the beginning and 94.3MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:26:40,477 INFO L158 Benchmark]: RCFGBuilder took 288.53ms. Allocated memory is still 155.2MB. Free memory was 94.3MB in the beginning and 80.2MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:26:40,477 INFO L158 Benchmark]: BuchiAutomizer took 2930.69ms. Allocated memory was 155.2MB in the beginning and 281.0MB in the end (delta: 125.8MB). Free memory was 79.4MB in the beginning and 153.2MB in the end (delta: -73.8MB). Peak memory consumption was 50.9MB. Max. memory is 8.0GB. [2025-04-26 18:26:40,479 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.88ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.93ms. Allocated memory is still 155.2MB. Free memory was 111.2MB in the beginning and 96.8MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.60ms. Allocated memory is still 155.2MB. Free memory was 96.8MB in the beginning and 95.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.00ms. Allocated memory is still 155.2MB. Free memory was 95.3MB in the beginning and 94.3MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 288.53ms. Allocated memory is still 155.2MB. Free memory was 94.3MB in the beginning and 80.2MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2930.69ms. Allocated memory was 155.2MB in the beginning and 281.0MB in the end (delta: 125.8MB). Free memory was 79.4MB in the beginning and 153.2MB in the end (delta: -73.8MB). Peak memory consumption was 50.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 2 iterations. TraceHistogramMax:2. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 1772 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, 166 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 327 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 166 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 161 mSDtfsCounter, 40 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: 1.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 1265, Number of transitions in reduction automaton: 5332, Number of states in reduction automaton: 3650, 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 3803 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, d3, g1, g2, g3; VAL [d1=0, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0] [L94] 0 pthread_t t1, t2, t3; VAL [d1=0, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0] [L97] 0 d1 = 1 VAL [d1=1, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0] [L98] 0 d2 = 1 VAL [d1=1, d2=1, d3=0, g1=0, g2=0, g3=0, pos=0] [L99] 0 d3 = 1 VAL [d1=1, d2=1, d3=1, g1=0, g2=0, g3=0, pos=0] [L100] 0 g1 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=0, g3=0, pos=0] [L101] 0 g2 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=0, pos=0] [L102] 0 g3 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=1, pos=0] [L105] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\at(_argptr, Pre)={0:0}, d1=1, d2=1, d3=1, g1=1, g2=1, g3=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, d3, g1, g2, g3; VAL [d1=0, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0] [L94] 0 pthread_t t1, t2, t3; VAL [d1=0, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0] [L97] 0 d1 = 1 VAL [d1=1, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0] [L98] 0 d2 = 1 VAL [d1=1, d2=1, d3=0, g1=0, g2=0, g3=0, pos=0] [L99] 0 d3 = 1 VAL [d1=1, d2=1, d3=1, g1=0, g2=0, g3=0, pos=0] [L100] 0 g1 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=0, g3=0, pos=0] [L101] 0 g2 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=0, pos=0] [L102] 0 g3 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=1, pos=0] [L105] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\at(_argptr, Pre)={0:0}, d1=1, d2=1, d3=1, g1=1, g2=1, g3=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 18:26:40,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...