/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/clever.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:37:16,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:37:16,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:37:16,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:37:16,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:37:16,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:37:16,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:37:16,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:37:16,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:37:16,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:37:16,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:37:16,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:37:16,101 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:37:16,101 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:37:16,101 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:37:16,101 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:37:16,101 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:37:16,101 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:37:16,101 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:37:16,101 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:37:16,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:37:16,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:37:16,101 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:37:16,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:37:16,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:37:16,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:37:16,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:37:16,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:37:16,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:37:16,102 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:37:16,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:37:16,102 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:37:16,102 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:37:16,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:37:16,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:37:16,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:37:16,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:37:16,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:37:16,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:37:16,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:37:16,102 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:37:16,102 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:37:16,103 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:37:16,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:37:16,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:37:16,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:37:16,331 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:37:16,331 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:37:16,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/clever.wvr.c [2025-04-26 16:37:17,656 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0d6ed2b89/aa0f672ebc3e4c73a2b3bab290ad3d98/FLAG597962bc2 [2025-04-26 16:37:17,847 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:37:17,847 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2025-04-26 16:37:17,853 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0d6ed2b89/aa0f672ebc3e4c73a2b3bab290ad3d98/FLAG597962bc2 [2025-04-26 16:37:18,707 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0d6ed2b89/aa0f672ebc3e4c73a2b3bab290ad3d98 [2025-04-26 16:37:18,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:37:18,710 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:37:18,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:37:18,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:37:18,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:37:18,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:37:18" (1/1) ... [2025-04-26 16:37:18,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a48c4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:37:18, skipping insertion in model container [2025-04-26 16:37:18,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:37:18" (1/1) ... [2025-04-26 16:37:18,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:37:18,890 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/clever.wvr.c[2159,2172] [2025-04-26 16:37:18,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:37:18,904 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:37:18,931 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/clever.wvr.c[2159,2172] [2025-04-26 16:37:18,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:37:18,943 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:37:18,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:37:18 WrapperNode [2025-04-26 16:37:18,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:37:18,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:37:18,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:37:18,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:37:18,949 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:37:18" (1/1) ... [2025-04-26 16:37:18,955 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:37:18" (1/1) ... [2025-04-26 16:37:18,970 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2025-04-26 16:37:18,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:37:18,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:37:18,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:37:18,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:37:18,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:37:18" (1/1) ... [2025-04-26 16:37:18,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:37:18" (1/1) ... [2025-04-26 16:37:18,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:37:18" (1/1) ... [2025-04-26 16:37:18,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:37:18" (1/1) ... [2025-04-26 16:37:18,984 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:37:18" (1/1) ... [2025-04-26 16:37:18,984 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:37:18" (1/1) ... [2025-04-26 16:37:18,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:37:18" (1/1) ... [2025-04-26 16:37:18,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:37:18" (1/1) ... [2025-04-26 16:37:18,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:37:18" (1/1) ... [2025-04-26 16:37:18,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:37:18,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:37:18,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:37:18,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:37:18,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:37:18" (1/1) ... [2025-04-26 16:37:18,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:37:19,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:19,014 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:37:19,016 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:37:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:37:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:37:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:37:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:37:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:37:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:37:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:37:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:37:19,032 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:37:19,092 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:37:19,093 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:37:19,234 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:37:19,234 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:37:19,242 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:37:19,242 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:37:19,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:37:19 BoogieIcfgContainer [2025-04-26 16:37:19,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:37:19,243 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:37:19,243 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:37:19,247 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:37:19,247 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:37:19,248 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 04:37:18" (1/3) ... [2025-04-26 16:37:19,248 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@eefb7a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:37:19, skipping insertion in model container [2025-04-26 16:37:19,248 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:37:19,248 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:37:18" (2/3) ... [2025-04-26 16:37:19,248 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@eefb7a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:37:19, skipping insertion in model container [2025-04-26 16:37:19,248 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:37:19,248 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:37:19" (3/3) ... [2025-04-26 16:37:19,249 INFO L376 chiAutomizerObserver]: Analyzing ICFG clever.wvr.c [2025-04-26 16:37:19,304 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:37:19,336 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:37:19,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:37:19,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:19,340 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:37:19,341 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:37:19,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 112 transitions, 238 flow [2025-04-26 16:37:19,434 INFO L116 PetriNetUnfolderBase]: 6/108 cut-off events. [2025-04-26 16:37:19,437 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:37:19,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 108 events. 6/108 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2025-04-26 16:37:19,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 112 transitions, 238 flow [2025-04-26 16:37:19,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 108 transitions, 228 flow [2025-04-26 16:37:19,445 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 109 places, 108 transitions, 228 flow [2025-04-26 16:37:19,450 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:37:19,559 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 796#[L77, L41-4, L51-1]true [2025-04-26 16:37:19,576 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 960#[L76-5, L41-4, L51-1]true [2025-04-26 16:37:19,595 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1114#[L76-4, L41-4, L51-1]true [2025-04-26 16:37:19,602 WARN L140 AmpleReduction]: Number of pruned transitions: 587 [2025-04-26 16:37:19,602 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 3 [2025-04-26 16:37:19,602 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 57 [2025-04-26 16:37:19,602 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:100 [2025-04-26 16:37:19,602 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:377 [2025-04-26 16:37:19,602 WARN L145 AmpleReduction]: Times succ was already a loop node:14 [2025-04-26 16:37:19,602 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:75 [2025-04-26 16:37:19,602 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:37:19,605 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 532 states, 530 states have (on average 1.288679245283019) internal successors, (in total 683), 531 states have internal predecessors, (683), 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:37:19,612 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:37:19,612 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:37:19,612 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:37:19,612 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:37:19,612 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:37:19,612 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:37:19,612 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:37:19,613 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:37:19,615 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 532 states, 530 states have (on average 1.288679245283019) internal successors, (in total 683), 531 states have internal predecessors, (683), 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:37:19,637 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 395 [2025-04-26 16:37:19,637 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:37:19,637 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:37:19,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:37:19,645 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:37:19,645 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:37:19,646 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 532 states, 530 states have (on average 1.288679245283019) internal successors, (in total 683), 531 states have internal predecessors, (683), 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:37:19,655 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 395 [2025-04-26 16:37:19,655 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:37:19,655 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:37:19,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:37:19,656 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:37:19,663 INFO L752 eck$LassoCheckResult]: Stem: "[156] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[162] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[197] 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[]" "[216] 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[]" "[165] 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[]" "[190] L21-3-->L21-4: Formula: (and (= (select |v_#length_2| 2) 13) (= (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[]" "[176] L21-4-->L36: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0]" "[224] L36-->L36-1: Formula: (= v_~m~0_4 0) InVars {} OutVars{~m~0=v_~m~0_4} AuxVars[] AssignedVars[~m~0]" "[211] L36-1-->L36-2: Formula: (= v_~i1~0_5 0) InVars {} OutVars{~i1~0=v_~i1~0_5} AuxVars[] AssignedVars[~i1~0]" "[202] L36-2-->L36-3: Formula: (= v_~i2~0_5 0) InVars {} OutVars{~i2~0=v_~i2~0_5} AuxVars[] AssignedVars[~i2~0]" "[183] L36-3-->L37: Formula: (= v_~j1~0_6 0) InVars {} OutVars{~j1~0=v_~j1~0_6} AuxVars[] AssignedVars[~j1~0]" "[170] L37-->L37-1: Formula: (= v_~k1~0_3 0) InVars {} OutVars{~k1~0=v_~k1~0_3} AuxVars[] AssignedVars[~k1~0]" "[171] L37-1-->L-1-1: Formula: (= v_~k2~0_3 0) InVars {} OutVars{~k2~0=v_~k2~0_3} AuxVars[] AssignedVars[~k2~0]" "[226] 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]" "[228] L-1-2-->L60: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[231] L60-->L60-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[160] L60-1-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[135] L63-->L63-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1]" "[210] L63-1-->L63-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_4| v_~n~0_6) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} OutVars{~n~0=v_~n~0_6, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[~n~0]" "[146] L63-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1]" "[147] L64-->L64-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[227] L64-1-->L64-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_4| v_~m~0_5) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} OutVars{~m~0=v_~m~0_5, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[~m~0]" "[240] L64-2-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[241] L65-->L65-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[169] L65-1-->L65-2: Formula: (= v_~i1~0_6 |v_ULTIMATE.start_main_#t~nondet7#1_4|) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~i1~0=v_~i1~0_6} AuxVars[] AssignedVars[~i1~0]" "[161] L65-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[158] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[172] L66-1-->L66-2: Formula: (= v_~i2~0_6 |v_ULTIMATE.start_main_#t~nondet8#1_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|, ~i2~0=v_~i2~0_6} AuxVars[] AssignedVars[~i2~0]" "[163] L66-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[218] L67-->L67-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[195] L67-1-->L67-2: Formula: (= v_~j1~0_7 |v_ULTIMATE.start_main_#t~nondet9#1_4|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|, ~j1~0=v_~j1~0_7} AuxVars[] AssignedVars[~j1~0]" "[143] L67-2-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[225] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[194] L68-1-->L68-2: Formula: (= v_~k1~0_4 |v_ULTIMATE.start_main_#t~nondet10#1_4|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} OutVars{~k1~0=v_~k1~0_4, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[~k1~0]" "[184] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[144] L69-->L69-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[229] L69-1-->L69-2: Formula: (= v_~k2~0_4 |v_ULTIMATE.start_main_#t~nondet11#1_4|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} OutVars{~k2~0=v_~k2~0_4, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[~k2~0]" "[200] L69-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[177] L72-->L72-1: Formula: (= (ite (let ((.cse0 (mod v_~i1~0_7 4294967296))) (and (= .cse0 (mod v_~k1~0_5 4294967296)) (= .cse0 (mod v_~k2~0_5 4294967296)) (= v_~i1~0_7 v_~i2~0_7) (= v_~i1~0_7 0))) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_5, ~k2~0=v_~k2~0_5} OutVars{~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_5, ~k2~0=v_~k2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[180] L72-1-->L32: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[193] L32-->L33: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[150] L33-->L32-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[159] L32-1-->L72-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[139] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[198] L73-->L73-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (<= 0 v_~m~0_6) 1 0)) InVars {~m~0=v_~m~0_6} OutVars{~m~0=v_~m~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[207] L73-1-->L32-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[203] L32-2-->L33-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[239] L33-3-->L32-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[196] L32-3-->L73-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[157] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[173] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_3| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[155] L75-1-->L75-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[215] L75-2-->L75-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_4| |v_ULTIMATE.start_main_#t~pre12#1_4|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[270] L75-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= |v_thread1Thread1of1ForFork0_#in~_argptr.base_4| 0) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread1Thread1of1ForFork0_#in~_argptr.base=|v_thread1Thread1of1ForFork0_#in~_argptr.base_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_~_argptr.base=v_thread1Thread1of1ForFork0_~_argptr.base_4, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, 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_#res.base, thread1Thread1of1ForFork0_~_argptr.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#in~_argptr.offset, thread1Thread1of1ForFork0_~_argptr.offset]" "[242] $Ultimate##0-->L40-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:37:19,664 INFO L754 eck$LassoCheckResult]: Loop: "[244] L40-1-->L41: Formula: (< v_~i1~0_1 v_~n~0_1) InVars {~n~0=v_~n~0_1, ~i1~0=v_~i1~0_1} OutVars{~n~0=v_~n~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[]" "[246] L41-->L41-5: Formula: (= v_~j1~0_1 0) InVars {} OutVars{~j1~0=v_~j1~0_1} AuxVars[] AssignedVars[~j1~0]" "[248] L41-5-->L44: Formula: (<= v_~m~0_2 v_~j1~0_5) InVars {~j1~0=v_~j1~0_5, ~m~0=v_~m~0_2} OutVars{~j1~0=v_~j1~0_5, ~m~0=v_~m~0_2} AuxVars[] AssignedVars[]" "[250] L44-->L44-1: Formula: (= v_~i1~0_2 |v_thread1Thread1of1ForFork0_#t~post3_1|) InVars {~i1~0=v_~i1~0_2} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3]" "[252] L44-1-->L44-2: Formula: (= v_~i1~0_3 (+ |v_thread1Thread1of1ForFork0_#t~post3_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_3|} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_3|, ~i1~0=v_~i1~0_3} AuxVars[] AssignedVars[~i1~0]" "[254] L44-2-->L40-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3]" [2025-04-26 16:37:19,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:19,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1708953375, now seen corresponding path program 1 times [2025-04-26 16:37:19,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:37:19,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179238761] [2025-04-26 16:37:19,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:37:19,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:37:19,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-26 16:37:19,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-26 16:37:19,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:19,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:19,771 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:37:19,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-26 16:37:19,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-26 16:37:19,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:19,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:19,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:37:19,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:19,821 INFO L85 PathProgramCache]: Analyzing trace with hash -482095417, now seen corresponding path program 1 times [2025-04-26 16:37:19,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:37:19,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663880151] [2025-04-26 16:37:19,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:37:19,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:37:19,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:37:19,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:37:19,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:19,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:19,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:37:19,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:37:19,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:37:19,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:19,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:19,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:37:19,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:19,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1110708069, now seen corresponding path program 1 times [2025-04-26 16:37:19,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:37:19,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534854297] [2025-04-26 16:37:19,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:37:19,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:37:19,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-26 16:37:19,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-26 16:37:19,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:19,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:19,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:37:19,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-26 16:37:19,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-26 16:37:19,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:19,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:19,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:37:20,011 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:37:20,011 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:37:20,012 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:37:20,012 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:37:20,012 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:37:20,012 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:20,012 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:37:20,012 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:37:20,012 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_petrified1_Iteration1_Loop [2025-04-26 16:37:20,012 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:37:20,012 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:37:20,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,126 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:37:20,126 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:37:20,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:20,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:20,129 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:20,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:37:20,133 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:20,133 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:20,152 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:20,153 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_1=1} Honda state: {v_rep#funAddr~thread2.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:20,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:37:20,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:20,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:20,161 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:20,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:37:20,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:20,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:20,180 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:20,180 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_1=-1} Honda state: {v_rep#funAddr~thread1.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:20,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:37:20,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:20,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:20,188 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:20,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:37:20,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:20,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:20,204 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:20,204 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post3=0} Honda state: {thread1Thread1of1ForFork0_#t~post3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:20,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:37:20,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:20,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:20,213 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:20,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:37:20,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:20,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:20,235 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:20,235 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_1=0} Honda state: {v_rep#funAddr~thread1.offset_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:20,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:37:20,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:20,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:20,242 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:20,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:37:20,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:20,244 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:20,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:37:20,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:20,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:20,264 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:20,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:37:20,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:37:20,265 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:20,331 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:37:20,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:37:20,336 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:37:20,336 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:37:20,336 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:37:20,336 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:37:20,336 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:37:20,336 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:20,336 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:37:20,336 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:37:20,336 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_petrified1_Iteration1_Loop [2025-04-26 16:37:20,336 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:37:20,336 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:37:20,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:20,412 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:37:20,415 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:37:20,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:20,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:20,418 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:20,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:37:20,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:20,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:20,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:20,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:20,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:20,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:37:20,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:37:20,439 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:20,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:37:20,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:20,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:20,447 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:20,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:37:20,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:20,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:20,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:20,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:20,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:20,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:37:20,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:37:20,464 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:20,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:37:20,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:20,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:20,473 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:20,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:37:20,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:20,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:20,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:20,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:20,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:20,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:37:20,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:37:20,502 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:20,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:37:20,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:20,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:20,515 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:20,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:37:20,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:20,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:20,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:37:20,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:20,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:20,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:20,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:37:20,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:37:20,529 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:20,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:37:20,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:20,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:20,538 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:20,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:37:20,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:20,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:20,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:20,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:20,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:20,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:37:20,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:37:20,554 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:20,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:37:20,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:20,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:20,562 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:20,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:37:20,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:20,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:20,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:37:20,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:20,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:20,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:20,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:37:20,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:37:20,577 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:37:20,581 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:37:20,581 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:37:20,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:20,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:20,584 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:20,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:37:20,587 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:37:20,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:20,591 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:37:20,591 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:37:20,591 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i1~0, ~n~0) = -1*~i1~0 + 1*~n~0 Supporting invariants [] [2025-04-26 16:37:20,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:20,599 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:37:20,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:20,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-26 16:37:20,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-26 16:37:20,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:20,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:37:20,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:37:20,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:37:20,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:37:20,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:37:20,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:20,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:37:20,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:37:20,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:37:20,801 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:37:20,818 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:37:20,820 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 532 states, 530 states have (on average 1.288679245283019) internal successors, (in total 683), 531 states have internal predecessors, (683), 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 5 states, 5 states have (on average 12.2) internal successors, (in total 61), 5 states have internal predecessors, (61), 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:37:20,940 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 532 states, 530 states have (on average 1.288679245283019) internal successors, (in total 683), 531 states have internal predecessors, (683), 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 5 states, 5 states have (on average 12.2) internal successors, (in total 61), 5 states have internal predecessors, (61), 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) Result 1477 states and 1937 transitions. Complement of second has 9 states. [2025-04-26 16:37:20,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:37:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (in total 61), 5 states have internal predecessors, (61), 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:37:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2025-04-26 16:37:20,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 200 transitions. Stem has 55 letters. Loop has 6 letters. [2025-04-26 16:37:20,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:37:20,949 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 200 transitions. Stem has 61 letters. Loop has 6 letters. [2025-04-26 16:37:20,949 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:37:20,949 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 200 transitions. Stem has 55 letters. Loop has 12 letters. [2025-04-26 16:37:20,949 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:37:20,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1477 states and 1937 transitions. [2025-04-26 16:37:20,962 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 245 [2025-04-26 16:37:20,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1477 states to 778 states and 1004 transitions. [2025-04-26 16:37:20,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2025-04-26 16:37:20,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 411 [2025-04-26 16:37:20,974 INFO L74 IsDeterministic]: Start isDeterministic. Operand 778 states and 1004 transitions. [2025-04-26 16:37:20,974 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:37:20,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 778 states and 1004 transitions. [2025-04-26 16:37:20,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states and 1004 transitions. [2025-04-26 16:37:21,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 769. [2025-04-26 16:37:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 769 states have (on average 1.2860858257477243) internal successors, (in total 989), 768 states have internal predecessors, (989), 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:37:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 989 transitions. [2025-04-26 16:37:21,019 INFO L240 hiAutomatonCegarLoop]: Abstraction has 769 states and 989 transitions. [2025-04-26 16:37:21,019 INFO L438 stractBuchiCegarLoop]: Abstraction has 769 states and 989 transitions. [2025-04-26 16:37:21,019 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:37:21,019 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 769 states and 989 transitions. [2025-04-26 16:37:21,021 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 245 [2025-04-26 16:37:21,022 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:37:21,022 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:37:21,022 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:37:21,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:37:21,042 INFO L752 eck$LassoCheckResult]: Stem: "[156] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[162] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[197] 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[]" "[216] 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[]" "[165] 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[]" "[190] L21-3-->L21-4: Formula: (and (= (select |v_#length_2| 2) 13) (= (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[]" "[176] L21-4-->L36: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0]" "[224] L36-->L36-1: Formula: (= v_~m~0_4 0) InVars {} OutVars{~m~0=v_~m~0_4} AuxVars[] AssignedVars[~m~0]" "[211] L36-1-->L36-2: Formula: (= v_~i1~0_5 0) InVars {} OutVars{~i1~0=v_~i1~0_5} AuxVars[] AssignedVars[~i1~0]" "[202] L36-2-->L36-3: Formula: (= v_~i2~0_5 0) InVars {} OutVars{~i2~0=v_~i2~0_5} AuxVars[] AssignedVars[~i2~0]" "[183] L36-3-->L37: Formula: (= v_~j1~0_6 0) InVars {} OutVars{~j1~0=v_~j1~0_6} AuxVars[] AssignedVars[~j1~0]" "[170] L37-->L37-1: Formula: (= v_~k1~0_3 0) InVars {} OutVars{~k1~0=v_~k1~0_3} AuxVars[] AssignedVars[~k1~0]" "[171] L37-1-->L-1-1: Formula: (= v_~k2~0_3 0) InVars {} OutVars{~k2~0=v_~k2~0_3} AuxVars[] AssignedVars[~k2~0]" "[226] 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]" "[228] L-1-2-->L60: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[231] L60-->L60-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[160] L60-1-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[135] L63-->L63-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1]" "[210] L63-1-->L63-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_4| v_~n~0_6) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} OutVars{~n~0=v_~n~0_6, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[~n~0]" "[146] L63-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1]" "[147] L64-->L64-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[227] L64-1-->L64-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_4| v_~m~0_5) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} OutVars{~m~0=v_~m~0_5, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[~m~0]" "[240] L64-2-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[241] L65-->L65-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[169] L65-1-->L65-2: Formula: (= v_~i1~0_6 |v_ULTIMATE.start_main_#t~nondet7#1_4|) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~i1~0=v_~i1~0_6} AuxVars[] AssignedVars[~i1~0]" "[161] L65-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[158] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[172] L66-1-->L66-2: Formula: (= v_~i2~0_6 |v_ULTIMATE.start_main_#t~nondet8#1_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|, ~i2~0=v_~i2~0_6} AuxVars[] AssignedVars[~i2~0]" "[163] L66-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[218] L67-->L67-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[195] L67-1-->L67-2: Formula: (= v_~j1~0_7 |v_ULTIMATE.start_main_#t~nondet9#1_4|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|, ~j1~0=v_~j1~0_7} AuxVars[] AssignedVars[~j1~0]" "[143] L67-2-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[225] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[194] L68-1-->L68-2: Formula: (= v_~k1~0_4 |v_ULTIMATE.start_main_#t~nondet10#1_4|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} OutVars{~k1~0=v_~k1~0_4, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[~k1~0]" "[184] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[144] L69-->L69-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[229] L69-1-->L69-2: Formula: (= v_~k2~0_4 |v_ULTIMATE.start_main_#t~nondet11#1_4|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} OutVars{~k2~0=v_~k2~0_4, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[~k2~0]" "[200] L69-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[177] L72-->L72-1: Formula: (= (ite (let ((.cse0 (mod v_~i1~0_7 4294967296))) (and (= .cse0 (mod v_~k1~0_5 4294967296)) (= .cse0 (mod v_~k2~0_5 4294967296)) (= v_~i1~0_7 v_~i2~0_7) (= v_~i1~0_7 0))) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_5, ~k2~0=v_~k2~0_5} OutVars{~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_5, ~k2~0=v_~k2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[180] L72-1-->L32: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[193] L32-->L33: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[150] L33-->L32-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[159] L32-1-->L72-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[139] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[198] L73-->L73-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (<= 0 v_~m~0_6) 1 0)) InVars {~m~0=v_~m~0_6} OutVars{~m~0=v_~m~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[207] L73-1-->L32-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[203] L32-2-->L33-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[239] L33-3-->L32-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[196] L32-3-->L73-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[157] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[173] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_3| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[155] L75-1-->L75-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[215] L75-2-->L75-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_4| |v_ULTIMATE.start_main_#t~pre12#1_4|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[270] L75-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= |v_thread1Thread1of1ForFork0_#in~_argptr.base_4| 0) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread1Thread1of1ForFork0_#in~_argptr.base=|v_thread1Thread1of1ForFork0_#in~_argptr.base_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_~_argptr.base=v_thread1Thread1of1ForFork0_~_argptr.base_4, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, 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_#res.base, thread1Thread1of1ForFork0_~_argptr.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#in~_argptr.offset, thread1Thread1of1ForFork0_~_argptr.offset]" "[242] $Ultimate##0-->L40-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]" "[244] L40-1-->L41: Formula: (< v_~i1~0_1 v_~n~0_1) InVars {~n~0=v_~n~0_1, ~i1~0=v_~i1~0_1} OutVars{~n~0=v_~n~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[]" "[246] L41-->L41-5: Formula: (= v_~j1~0_1 0) InVars {} OutVars{~j1~0=v_~j1~0_1} AuxVars[] AssignedVars[~j1~0]" [2025-04-26 16:37:21,042 INFO L754 eck$LassoCheckResult]: Loop: "[249] L41-5-->L42: Formula: (< v_~j1~0_2 v_~m~0_1) InVars {~j1~0=v_~j1~0_2, ~m~0=v_~m~0_1} OutVars{~j1~0=v_~j1~0_2, ~m~0=v_~m~0_1} AuxVars[] AssignedVars[]" "[251] L42-->L42-1: Formula: (= v_~k1~0_1 |v_thread1Thread1of1ForFork0_#t~post1_1|) InVars {~k1~0=v_~k1~0_1} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~k1~0=v_~k1~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1]" "[253] L42-1-->L42-2: Formula: (= v_~k1~0_2 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{~k1~0=v_~k1~0_2, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} AuxVars[] AssignedVars[~k1~0]" "[255] L42-2-->L41-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1]" "[256] L41-2-->L41-3: Formula: (= v_~j1~0_3 |v_thread1Thread1of1ForFork0_#t~post2_1|) InVars {~j1~0=v_~j1~0_3} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~j1~0=v_~j1~0_3} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2]" "[257] L41-3-->L41-4: Formula: (= v_~j1~0_4 (+ |v_thread1Thread1of1ForFork0_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_3|} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_3|, ~j1~0=v_~j1~0_4} AuxVars[] AssignedVars[~j1~0]" "[258] L41-4-->L41-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2]" [2025-04-26 16:37:21,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:21,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1626694113, now seen corresponding path program 1 times [2025-04-26 16:37:21,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:37:21,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199849468] [2025-04-26 16:37:21,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:37:21,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:37:21,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-26 16:37:21,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-26 16:37:21,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:21,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:21,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:37:21,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-26 16:37:21,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-26 16:37:21,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:21,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:21,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:37:21,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:21,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1769588420, now seen corresponding path program 1 times [2025-04-26 16:37:21,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:37:21,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013235214] [2025-04-26 16:37:21,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:37:21,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:37:21,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:37:21,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:37:21,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:21,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:21,081 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:37:21,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:37:21,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:37:21,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:21,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:21,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:37:21,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:21,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1593375580, now seen corresponding path program 1 times [2025-04-26 16:37:21,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:37:21,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60443946] [2025-04-26 16:37:21,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:37:21,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:37:21,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-26 16:37:21,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-26 16:37:21,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:21,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:21,104 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:37:21,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-26 16:37:21,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-26 16:37:21,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:21,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:21,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:37:21,161 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:37:21,161 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:37:21,162 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:37:21,162 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:37:21,162 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:37:21,162 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:21,162 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:37:21,162 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:37:21,162 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_petrified1_Iteration2_Loop [2025-04-26 16:37:21,162 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:37:21,162 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:37:21,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,235 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:37:21,235 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:37:21,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:21,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:21,238 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:21,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:37:21,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:21,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:21,258 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:21,258 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_3=1} Honda state: {v_rep#funAddr~thread2.offset_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:21,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:37:21,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:21,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:21,266 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:21,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:37:21,267 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:21,267 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:21,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:37:21,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:21,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:21,285 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:21,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:37:21,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:37:21,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:21,346 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:37:21,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:37:21,351 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:37:21,351 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:37:21,351 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:37:21,351 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:37:21,351 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:37:21,351 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:21,351 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:37:21,351 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:37:21,351 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_petrified1_Iteration2_Loop [2025-04-26 16:37:21,351 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:37:21,351 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:37:21,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,425 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:37:21,425 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:37:21,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:21,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:21,427 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:21,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:37:21,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:21,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:21,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:21,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:21,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:21,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:37:21,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:37:21,450 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:21,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:21,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:21,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:21,458 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:21,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:37:21,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:21,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:21,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:21,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:21,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:21,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:37:21,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:37:21,475 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:21,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:21,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:21,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:21,483 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:21,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:37:21,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:21,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:21,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:37:21,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:21,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:21,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:21,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:37:21,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:37:21,498 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:37:21,500 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:37:21,500 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:37:21,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:21,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:21,503 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:21,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:37:21,505 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:37:21,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:21,508 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:37:21,508 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:37:21,508 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~j1~0, ~m~0) = -1*~j1~0 + 1*~m~0 Supporting invariants [] [2025-04-26 16:37:21,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:21,514 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:37:21,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:21,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-26 16:37:21,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-26 16:37:21,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:21,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:37:21,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:37:21,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:37:21,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:37:21,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:37:21,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:21,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:37:21,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:37:21,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:37:21,656 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:37:21,657 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:37:21,657 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 769 states and 989 transitions. cyclomatic complexity: 275 Second operand has 5 states, 5 states have (on average 12.8) internal successors, (in total 64), 5 states have internal predecessors, (64), 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:37:21,742 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 769 states and 989 transitions. cyclomatic complexity: 275. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (in total 64), 5 states have internal predecessors, (64), 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) Result 1276 states and 1613 transitions. Complement of second has 9 states. [2025-04-26 16:37:21,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:37:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (in total 64), 5 states have internal predecessors, (64), 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:37:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-04-26 16:37:21,743 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 114 transitions. Stem has 57 letters. Loop has 7 letters. [2025-04-26 16:37:21,744 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:37:21,744 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 114 transitions. Stem has 64 letters. Loop has 7 letters. [2025-04-26 16:37:21,744 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:37:21,744 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 114 transitions. Stem has 57 letters. Loop has 14 letters. [2025-04-26 16:37:21,744 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:37:21,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1276 states and 1613 transitions. [2025-04-26 16:37:21,754 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 300 [2025-04-26 16:37:21,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1276 states to 996 states and 1282 transitions. [2025-04-26 16:37:21,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 513 [2025-04-26 16:37:21,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 513 [2025-04-26 16:37:21,759 INFO L74 IsDeterministic]: Start isDeterministic. Operand 996 states and 1282 transitions. [2025-04-26 16:37:21,759 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:37:21,759 INFO L218 hiAutomatonCegarLoop]: Abstraction has 996 states and 1282 transitions. [2025-04-26 16:37:21,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states and 1282 transitions. [2025-04-26 16:37:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 839. [2025-04-26 16:37:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 839 states have (on average 1.2920143027413589) internal successors, (in total 1084), 838 states have internal predecessors, (1084), 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:37:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1084 transitions. [2025-04-26 16:37:21,773 INFO L240 hiAutomatonCegarLoop]: Abstraction has 839 states and 1084 transitions. [2025-04-26 16:37:21,773 INFO L438 stractBuchiCegarLoop]: Abstraction has 839 states and 1084 transitions. [2025-04-26 16:37:21,773 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:37:21,774 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 839 states and 1084 transitions. [2025-04-26 16:37:21,776 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 245 [2025-04-26 16:37:21,776 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:37:21,776 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:37:21,777 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:37:21,777 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:37:21,777 INFO L752 eck$LassoCheckResult]: Stem: "[156] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[162] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[197] 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[]" "[216] 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[]" "[165] 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[]" "[190] L21-3-->L21-4: Formula: (and (= (select |v_#length_2| 2) 13) (= (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[]" "[176] L21-4-->L36: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0]" "[224] L36-->L36-1: Formula: (= v_~m~0_4 0) InVars {} OutVars{~m~0=v_~m~0_4} AuxVars[] AssignedVars[~m~0]" "[211] L36-1-->L36-2: Formula: (= v_~i1~0_5 0) InVars {} OutVars{~i1~0=v_~i1~0_5} AuxVars[] AssignedVars[~i1~0]" "[202] L36-2-->L36-3: Formula: (= v_~i2~0_5 0) InVars {} OutVars{~i2~0=v_~i2~0_5} AuxVars[] AssignedVars[~i2~0]" "[183] L36-3-->L37: Formula: (= v_~j1~0_6 0) InVars {} OutVars{~j1~0=v_~j1~0_6} AuxVars[] AssignedVars[~j1~0]" "[170] L37-->L37-1: Formula: (= v_~k1~0_3 0) InVars {} OutVars{~k1~0=v_~k1~0_3} AuxVars[] AssignedVars[~k1~0]" "[171] L37-1-->L-1-1: Formula: (= v_~k2~0_3 0) InVars {} OutVars{~k2~0=v_~k2~0_3} AuxVars[] AssignedVars[~k2~0]" "[226] 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]" "[228] L-1-2-->L60: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[231] L60-->L60-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[160] L60-1-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[135] L63-->L63-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1]" "[210] L63-1-->L63-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_4| v_~n~0_6) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} OutVars{~n~0=v_~n~0_6, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[~n~0]" "[146] L63-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1]" "[147] L64-->L64-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[227] L64-1-->L64-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_4| v_~m~0_5) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} OutVars{~m~0=v_~m~0_5, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[~m~0]" "[240] L64-2-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[241] L65-->L65-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[169] L65-1-->L65-2: Formula: (= v_~i1~0_6 |v_ULTIMATE.start_main_#t~nondet7#1_4|) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~i1~0=v_~i1~0_6} AuxVars[] AssignedVars[~i1~0]" "[161] L65-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[158] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[172] L66-1-->L66-2: Formula: (= v_~i2~0_6 |v_ULTIMATE.start_main_#t~nondet8#1_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|, ~i2~0=v_~i2~0_6} AuxVars[] AssignedVars[~i2~0]" "[163] L66-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[218] L67-->L67-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[195] L67-1-->L67-2: Formula: (= v_~j1~0_7 |v_ULTIMATE.start_main_#t~nondet9#1_4|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|, ~j1~0=v_~j1~0_7} AuxVars[] AssignedVars[~j1~0]" "[143] L67-2-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[225] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[194] L68-1-->L68-2: Formula: (= v_~k1~0_4 |v_ULTIMATE.start_main_#t~nondet10#1_4|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} OutVars{~k1~0=v_~k1~0_4, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[~k1~0]" "[184] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[144] L69-->L69-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[229] L69-1-->L69-2: Formula: (= v_~k2~0_4 |v_ULTIMATE.start_main_#t~nondet11#1_4|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} OutVars{~k2~0=v_~k2~0_4, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[~k2~0]" "[200] L69-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[177] L72-->L72-1: Formula: (= (ite (let ((.cse0 (mod v_~i1~0_7 4294967296))) (and (= .cse0 (mod v_~k1~0_5 4294967296)) (= .cse0 (mod v_~k2~0_5 4294967296)) (= v_~i1~0_7 v_~i2~0_7) (= v_~i1~0_7 0))) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_5, ~k2~0=v_~k2~0_5} OutVars{~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_5, ~k2~0=v_~k2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[180] L72-1-->L32: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[193] L32-->L33: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[150] L33-->L32-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[159] L32-1-->L72-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[139] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[198] L73-->L73-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (<= 0 v_~m~0_6) 1 0)) InVars {~m~0=v_~m~0_6} OutVars{~m~0=v_~m~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[207] L73-1-->L32-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[203] L32-2-->L33-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[239] L33-3-->L32-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[196] L32-3-->L73-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[157] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[173] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_3| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[155] L75-1-->L75-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[215] L75-2-->L75-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_4| |v_ULTIMATE.start_main_#t~pre12#1_4|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[270] L75-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= |v_thread1Thread1of1ForFork0_#in~_argptr.base_4| 0) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread1Thread1of1ForFork0_#in~_argptr.base=|v_thread1Thread1of1ForFork0_#in~_argptr.base_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_~_argptr.base=v_thread1Thread1of1ForFork0_~_argptr.base_4, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, 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_#res.base, thread1Thread1of1ForFork0_~_argptr.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#in~_argptr.offset, thread1Thread1of1ForFork0_~_argptr.offset]" "[242] $Ultimate##0-->L40-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]" "[244] L40-1-->L41: Formula: (< v_~i1~0_1 v_~n~0_1) InVars {~n~0=v_~n~0_1, ~i1~0=v_~i1~0_1} OutVars{~n~0=v_~n~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[]" "[246] L41-->L41-5: Formula: (= v_~j1~0_1 0) InVars {} OutVars{~j1~0=v_~j1~0_1} AuxVars[] AssignedVars[~j1~0]" "[248] L41-5-->L44: Formula: (<= v_~m~0_2 v_~j1~0_5) InVars {~j1~0=v_~j1~0_5, ~m~0=v_~m~0_2} OutVars{~j1~0=v_~j1~0_5, ~m~0=v_~m~0_2} AuxVars[] AssignedVars[]" "[250] L44-->L44-1: Formula: (= v_~i1~0_2 |v_thread1Thread1of1ForFork0_#t~post3_1|) InVars {~i1~0=v_~i1~0_2} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3]" "[252] L44-1-->L44-2: Formula: (= v_~i1~0_3 (+ |v_thread1Thread1of1ForFork0_#t~post3_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_3|} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_3|, ~i1~0=v_~i1~0_3} AuxVars[] AssignedVars[~i1~0]" "[254] L44-2-->L40-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3]" "[244] L40-1-->L41: Formula: (< v_~i1~0_1 v_~n~0_1) InVars {~n~0=v_~n~0_1, ~i1~0=v_~i1~0_1} OutVars{~n~0=v_~n~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[]" "[246] L41-->L41-5: Formula: (= v_~j1~0_1 0) InVars {} OutVars{~j1~0=v_~j1~0_1} AuxVars[] AssignedVars[~j1~0]" [2025-04-26 16:37:21,777 INFO L754 eck$LassoCheckResult]: Loop: "[249] L41-5-->L42: Formula: (< v_~j1~0_2 v_~m~0_1) InVars {~j1~0=v_~j1~0_2, ~m~0=v_~m~0_1} OutVars{~j1~0=v_~j1~0_2, ~m~0=v_~m~0_1} AuxVars[] AssignedVars[]" "[251] L42-->L42-1: Formula: (= v_~k1~0_1 |v_thread1Thread1of1ForFork0_#t~post1_1|) InVars {~k1~0=v_~k1~0_1} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~k1~0=v_~k1~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1]" "[253] L42-1-->L42-2: Formula: (= v_~k1~0_2 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{~k1~0=v_~k1~0_2, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} AuxVars[] AssignedVars[~k1~0]" "[255] L42-2-->L41-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1]" "[256] L41-2-->L41-3: Formula: (= v_~j1~0_3 |v_thread1Thread1of1ForFork0_#t~post2_1|) InVars {~j1~0=v_~j1~0_3} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~j1~0=v_~j1~0_3} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2]" "[257] L41-3-->L41-4: Formula: (= v_~j1~0_4 (+ |v_thread1Thread1of1ForFork0_#t~post2_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_3|} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_3|, ~j1~0=v_~j1~0_4} AuxVars[] AssignedVars[~j1~0]" "[258] L41-4-->L41-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2]" [2025-04-26 16:37:21,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:21,778 INFO L85 PathProgramCache]: Analyzing trace with hash -2056394585, now seen corresponding path program 2 times [2025-04-26 16:37:21,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:37:21,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543693611] [2025-04-26 16:37:21,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:37:21,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:37:21,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-04-26 16:37:21,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 16:37:21,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:37:21,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:21,793 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:37:21,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-26 16:37:21,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 16:37:21,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:21,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:21,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:37:21,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:21,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1769588420, now seen corresponding path program 2 times [2025-04-26 16:37:21,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:37:21,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572257485] [2025-04-26 16:37:21,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:37:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:37:21,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:37:21,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:37:21,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:37:21,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:21,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:37:21,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:37:21,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:37:21,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:21,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:21,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:37:21,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash -114923050, now seen corresponding path program 1 times [2025-04-26 16:37:21,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:37:21,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416643659] [2025-04-26 16:37:21,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:37:21,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:37:21,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 16:37:21,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 16:37:21,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:21,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:37:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:37:21,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:37:21,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416643659] [2025-04-26 16:37:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416643659] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:37:21,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:37:21,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:37:21,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795670844] [2025-04-26 16:37:21,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:37:21,995 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:37:21,995 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:37:21,995 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:37:21,995 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:37:21,995 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:37:21,995 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:21,995 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:37:21,995 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:37:21,995 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_petrified1_Iteration3_Loop [2025-04-26 16:37:21,995 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:37:21,995 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:37:21,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:21,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:22,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:22,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:22,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:22,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:22,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:22,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:22,056 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:37:22,056 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:37:22,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,058 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:37:22,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:22,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:22,071 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:22,071 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post2=0} Honda state: {thread1Thread1of1ForFork0_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:22,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:22,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,078 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:37:22,079 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:22,080 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:22,096 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:22,096 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_5=-1} Honda state: {v_rep#funAddr~thread1.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:22,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:37:22,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,103 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:37:22,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:22,105 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:22,124 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:22,125 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_5=1} Honda state: {v_rep#funAddr~thread2.offset_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:22,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:37:22,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,133 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:37:22,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:22,135 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:22,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:37:22,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,151 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:37:22,153 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:37:22,153 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:22,174 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:22,174 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~k1~0=0} Honda state: {~k1~0=0} Generalized eigenvectors: [{~k1~0=2}, {~k1~0=6}, {~k1~0=-7}] Lambdas: [1, 1, 1] Nus: [0, 0] [2025-04-26 16:37:22,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:37:22,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,181 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:37:22,183 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:22,183 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:22,193 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:22,193 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post1=0} Honda state: {thread1Thread1of1ForFork0_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:22,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:37:22,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,200 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:37:22,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:22,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:22,218 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:22,219 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_5=-1} Honda state: {v_rep#funAddr~thread2.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:22,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:37:22,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,226 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:37:22,229 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:22,229 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:22,246 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:22,246 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_5=0} Honda state: {v_rep#funAddr~thread1.offset_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:22,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:37:22,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,253 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:37:22,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:22,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:22,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:37:22,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,272 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:37:22,274 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:37:22,274 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:22,334 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:37:22,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:37:22,338 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:37:22,339 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:37:22,339 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:37:22,339 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:37:22,339 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:37:22,339 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,339 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:37:22,339 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:37:22,339 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_petrified1_Iteration3_Loop [2025-04-26 16:37:22,339 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:37:22,339 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:37:22,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:22,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:22,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:22,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:22,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:22,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:22,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:22,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:22,400 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:37:22,400 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:37:22,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,402 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:37:22,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:22,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:22,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:22,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:22,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:22,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:37:22,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:37:22,417 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:22,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:37:22,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,425 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:37:22,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:22,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:22,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:22,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:22,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:22,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:37:22,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:37:22,441 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:22,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:22,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,448 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:37:22,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:22,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:22,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:37:22,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:22,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:22,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:22,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:37:22,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:37:22,463 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:22,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:22,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,470 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:37:22,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:22,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:22,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:22,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:22,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:22,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:37:22,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:37:22,487 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:22,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:22,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,494 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:37:22,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:22,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:22,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:37:22,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:22,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:22,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:22,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:37:22,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:37:22,508 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:22,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:22,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,516 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:37:22,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:22,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:22,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:37:22,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:22,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:22,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:22,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:37:22,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:37:22,530 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:22,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 16:37:22,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,537 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:37:22,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:22,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:22,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:22,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:22,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:22,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:37:22,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:37:22,551 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:22,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 16:37:22,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,559 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:37:22,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:22,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:22,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:37:22,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:22,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:22,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:22,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:37:22,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:37:22,572 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:37:22,576 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:37:22,576 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:37:22,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:22,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:22,578 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:22,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:37:22,580 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:37:22,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 16:37:22,582 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:37:22,582 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:37:22,583 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~j1~0, ~m~0) = -1*~j1~0 + 1*~m~0 Supporting invariants [] [2025-04-26 16:37:22,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:37:22,588 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:37:22,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:22,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-26 16:37:22,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 16:37:22,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:22,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:37:22,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:37:22,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:37:22,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:37:22,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:37:22,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:22,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:37:22,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:37:22,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:37:22,713 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:37:22,714 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:37:22,714 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 839 states and 1084 transitions. cyclomatic complexity: 307 Second operand has 5 states, 5 states have (on average 13.8) internal successors, (in total 69), 5 states have internal predecessors, (69), 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:37:22,776 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 839 states and 1084 transitions. cyclomatic complexity: 307. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (in total 69), 5 states have internal predecessors, (69), 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) Result 1187 states and 1520 transitions. Complement of second has 9 states. [2025-04-26 16:37:22,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:37:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (in total 69), 5 states have internal predecessors, (69), 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:37:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-04-26 16:37:22,779 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 114 transitions. Stem has 63 letters. Loop has 7 letters. [2025-04-26 16:37:22,779 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:37:22,779 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:37:22,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:22,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-26 16:37:22,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 16:37:22,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:22,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:37:22,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:37:22,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:37:22,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:37:22,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:37:22,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:22,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:37:22,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:37:22,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:37:22,944 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:37:22,945 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:37:22,945 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 839 states and 1084 transitions. cyclomatic complexity: 307 Second operand has 5 states, 5 states have (on average 13.8) internal successors, (in total 69), 5 states have internal predecessors, (69), 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:37:23,016 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 839 states and 1084 transitions. cyclomatic complexity: 307. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (in total 69), 5 states have internal predecessors, (69), 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) Result 1184 states and 1507 transitions. Complement of second has 11 states. [2025-04-26 16:37:23,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-04-26 16:37:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (in total 69), 5 states have internal predecessors, (69), 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:37:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-04-26 16:37:23,018 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 115 transitions. Stem has 63 letters. Loop has 7 letters. [2025-04-26 16:37:23,018 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:37:23,018 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:37:23,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:23,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-26 16:37:23,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 16:37:23,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:23,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:37:23,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:37:23,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:37:23,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:37:23,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:37:23,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:23,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:37:23,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:37:23,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:37:23,151 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:37:23,152 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:37:23,152 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 839 states and 1084 transitions. cyclomatic complexity: 307 Second operand has 5 states, 5 states have (on average 13.8) internal successors, (in total 69), 5 states have internal predecessors, (69), 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:37:23,205 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 839 states and 1084 transitions. cyclomatic complexity: 307. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (in total 69), 5 states have internal predecessors, (69), 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) Result 1803 states and 2474 transitions. Complement of second has 8 states. [2025-04-26 16:37:23,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:37:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (in total 69), 5 states have internal predecessors, (69), 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:37:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2025-04-26 16:37:23,207 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 140 transitions. Stem has 63 letters. Loop has 7 letters. [2025-04-26 16:37:23,208 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:37:23,208 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 140 transitions. Stem has 70 letters. Loop has 7 letters. [2025-04-26 16:37:23,208 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:37:23,208 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 140 transitions. Stem has 63 letters. Loop has 14 letters. [2025-04-26 16:37:23,208 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:37:23,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1803 states and 2474 transitions. [2025-04-26 16:37:23,218 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 55 [2025-04-26 16:37:23,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1803 states to 581 states and 801 transitions. [2025-04-26 16:37:23,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2025-04-26 16:37:23,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2025-04-26 16:37:23,221 INFO L74 IsDeterministic]: Start isDeterministic. Operand 581 states and 801 transitions. [2025-04-26 16:37:23,221 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:37:23,222 INFO L218 hiAutomatonCegarLoop]: Abstraction has 581 states and 801 transitions. [2025-04-26 16:37:23,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states and 801 transitions. [2025-04-26 16:37:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 482. [2025-04-26 16:37:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.396265560165975) internal successors, (in total 673), 481 states have internal predecessors, (673), 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:37:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 673 transitions. [2025-04-26 16:37:23,230 INFO L240 hiAutomatonCegarLoop]: Abstraction has 482 states and 673 transitions. [2025-04-26 16:37:23,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:37:23,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:37:23,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:37:23,234 INFO L87 Difference]: Start difference. First operand 482 states and 673 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (in total 70), 5 states have internal predecessors, (70), 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:37:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:37:23,279 INFO L93 Difference]: Finished difference Result 829 states and 1090 transitions. [2025-04-26 16:37:23,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 829 states and 1090 transitions. [2025-04-26 16:37:23,283 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 70 [2025-04-26 16:37:23,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 829 states to 825 states and 1084 transitions. [2025-04-26 16:37:23,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2025-04-26 16:37:23,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2025-04-26 16:37:23,286 INFO L74 IsDeterministic]: Start isDeterministic. Operand 825 states and 1084 transitions. [2025-04-26 16:37:23,286 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:37:23,286 INFO L218 hiAutomatonCegarLoop]: Abstraction has 825 states and 1084 transitions. [2025-04-26 16:37:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states and 1084 transitions. [2025-04-26 16:37:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 613. [2025-04-26 16:37:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 613 states have (on average 1.4029363784665578) internal successors, (in total 860), 612 states have internal predecessors, (860), 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:37:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 860 transitions. [2025-04-26 16:37:23,297 INFO L240 hiAutomatonCegarLoop]: Abstraction has 613 states and 860 transitions. [2025-04-26 16:37:23,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:37:23,298 INFO L438 stractBuchiCegarLoop]: Abstraction has 613 states and 860 transitions. [2025-04-26 16:37:23,298 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:37:23,298 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 613 states and 860 transitions. [2025-04-26 16:37:23,300 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 16:37:23,300 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:37:23,300 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:37:23,301 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:37:23,301 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:37:23,302 INFO L752 eck$LassoCheckResult]: Stem: "[156] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[162] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[197] 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[]" "[216] 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[]" "[165] 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[]" "[190] L21-3-->L21-4: Formula: (and (= (select |v_#length_2| 2) 13) (= (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[]" "[176] L21-4-->L36: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0]" "[224] L36-->L36-1: Formula: (= v_~m~0_4 0) InVars {} OutVars{~m~0=v_~m~0_4} AuxVars[] AssignedVars[~m~0]" "[211] L36-1-->L36-2: Formula: (= v_~i1~0_5 0) InVars {} OutVars{~i1~0=v_~i1~0_5} AuxVars[] AssignedVars[~i1~0]" "[202] L36-2-->L36-3: Formula: (= v_~i2~0_5 0) InVars {} OutVars{~i2~0=v_~i2~0_5} AuxVars[] AssignedVars[~i2~0]" "[183] L36-3-->L37: Formula: (= v_~j1~0_6 0) InVars {} OutVars{~j1~0=v_~j1~0_6} AuxVars[] AssignedVars[~j1~0]" "[170] L37-->L37-1: Formula: (= v_~k1~0_3 0) InVars {} OutVars{~k1~0=v_~k1~0_3} AuxVars[] AssignedVars[~k1~0]" "[171] L37-1-->L-1-1: Formula: (= v_~k2~0_3 0) InVars {} OutVars{~k2~0=v_~k2~0_3} AuxVars[] AssignedVars[~k2~0]" "[226] 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]" "[228] L-1-2-->L60: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[231] L60-->L60-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[160] L60-1-->L63: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[135] L63-->L63-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1]" "[210] L63-1-->L63-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_4| v_~n~0_6) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} OutVars{~n~0=v_~n~0_6, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[~n~0]" "[146] L63-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1]" "[147] L64-->L64-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[227] L64-1-->L64-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_4| v_~m~0_5) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} OutVars{~m~0=v_~m~0_5, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[~m~0]" "[240] L64-2-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[241] L65-->L65-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[169] L65-1-->L65-2: Formula: (= v_~i1~0_6 |v_ULTIMATE.start_main_#t~nondet7#1_4|) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~i1~0=v_~i1~0_6} AuxVars[] AssignedVars[~i1~0]" "[161] L65-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[158] L66-->L66-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[172] L66-1-->L66-2: Formula: (= v_~i2~0_6 |v_ULTIMATE.start_main_#t~nondet8#1_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|, ~i2~0=v_~i2~0_6} AuxVars[] AssignedVars[~i2~0]" "[163] L66-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[218] L67-->L67-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[195] L67-1-->L67-2: Formula: (= v_~j1~0_7 |v_ULTIMATE.start_main_#t~nondet9#1_4|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|, ~j1~0=v_~j1~0_7} AuxVars[] AssignedVars[~j1~0]" "[143] L67-2-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[225] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[194] L68-1-->L68-2: Formula: (= v_~k1~0_4 |v_ULTIMATE.start_main_#t~nondet10#1_4|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} OutVars{~k1~0=v_~k1~0_4, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[~k1~0]" "[184] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[144] L69-->L69-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[229] L69-1-->L69-2: Formula: (= v_~k2~0_4 |v_ULTIMATE.start_main_#t~nondet11#1_4|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} OutVars{~k2~0=v_~k2~0_4, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[~k2~0]" "[200] L69-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[177] L72-->L72-1: Formula: (= (ite (let ((.cse0 (mod v_~i1~0_7 4294967296))) (and (= .cse0 (mod v_~k1~0_5 4294967296)) (= .cse0 (mod v_~k2~0_5 4294967296)) (= v_~i1~0_7 v_~i2~0_7) (= v_~i1~0_7 0))) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_5, ~k2~0=v_~k2~0_5} OutVars{~i2~0=v_~i2~0_7, ~i1~0=v_~i1~0_7, ~k1~0=v_~k1~0_5, ~k2~0=v_~k2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[180] L72-1-->L32: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[193] L32-->L33: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[150] L33-->L32-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[159] L32-1-->L72-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[139] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[198] L73-->L73-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (<= 0 v_~m~0_6) 1 0)) InVars {~m~0=v_~m~0_6} OutVars{~m~0=v_~m~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[207] L73-1-->L32-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[203] L32-2-->L33-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[239] L33-3-->L32-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[196] L32-3-->L73-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[157] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[173] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_3| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[155] L75-1-->L75-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[215] L75-2-->L75-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_4| |v_ULTIMATE.start_main_#t~pre12#1_4|) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[270] L75-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_7|) (= |v_thread1Thread1of1ForFork0_#in~_argptr.base_4| 0) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_7|, thread1Thread1of1ForFork0_#in~_argptr.base=|v_thread1Thread1of1ForFork0_#in~_argptr.base_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_~_argptr.base=v_thread1Thread1of1ForFork0_~_argptr.base_4, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, 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_#res.base, thread1Thread1of1ForFork0_~_argptr.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#in~_argptr.offset, thread1Thread1of1ForFork0_~_argptr.offset]" "[242] $Ultimate##0-->L40-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]" "[243] L40-1-->L47: Formula: (<= v_~n~0_2 v_~i1~0_4) InVars {~n~0=v_~n~0_2, ~i1~0=v_~i1~0_4} OutVars{~n~0=v_~n~0_2, ~i1~0=v_~i1~0_4} AuxVars[] AssignedVars[]" "[245] L47-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset]" "[247] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[217] L75-4-->L75-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1]" "[219] L75-5-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[178] L76-->L76-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_3| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[214] L76-1-->L76-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[220] L76-2-->L76-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_4| |v_ULTIMATE.start_main_#t~pre14#1_4|) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[273] L76-3-->$Ultimate##0: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_thread2Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= |v_thread2Thread1of1ForFork1_#in~_argptr.base_4| 0) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread2Thread1of1ForFork1_#in~_argptr.offset=|v_thread2Thread1of1ForFork1_#in~_argptr.offset_4|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, thread2Thread1of1ForFork1_~_argptr.base=v_thread2Thread1of1ForFork1_~_argptr.base_4, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_#in~_argptr.base=|v_thread2Thread1of1ForFork1_#in~_argptr.base_4|, thread2Thread1of1ForFork1_~_argptr.offset=v_thread2Thread1of1ForFork1_~_argptr.offset_4, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#in~_argptr.offset, thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~_argptr.base, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_#in~_argptr.base, thread2Thread1of1ForFork1_~_argptr.offset, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[259] $Ultimate##0-->L51-1: Formula: (and (= v_thread2Thread1of1ForFork1_~_argptr.base_1 |v_thread2Thread1of1ForFork1_#in~_argptr.base_1|) (= v_thread2Thread1of1ForFork1_~_argptr.offset_1 |v_thread2Thread1of1ForFork1_#in~_argptr.offset_1|)) InVars {thread2Thread1of1ForFork1_#in~_argptr.offset=|v_thread2Thread1of1ForFork1_#in~_argptr.offset_1|, thread2Thread1of1ForFork1_#in~_argptr.base=|v_thread2Thread1of1ForFork1_#in~_argptr.base_1|} OutVars{thread2Thread1of1ForFork1_#in~_argptr.offset=|v_thread2Thread1of1ForFork1_#in~_argptr.offset_1|, thread2Thread1of1ForFork1_#in~_argptr.base=|v_thread2Thread1of1ForFork1_#in~_argptr.base_1|, thread2Thread1of1ForFork1_~_argptr.offset=v_thread2Thread1of1ForFork1_~_argptr.offset_1, thread2Thread1of1ForFork1_~_argptr.base=v_thread2Thread1of1ForFork1_~_argptr.base_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~_argptr.base, thread2Thread1of1ForFork1_~_argptr.offset]" [2025-04-26 16:37:23,302 INFO L754 eck$LassoCheckResult]: Loop: "[261] L51-1-->L52: Formula: (< v_~i2~0_3 v_~n~0_4) InVars {~n~0=v_~n~0_4, ~i2~0=v_~i2~0_3} OutVars{~n~0=v_~n~0_4, ~i2~0=v_~i2~0_3} AuxVars[] AssignedVars[]" "[263] L52-->L53: Formula: (= v_~k2~0_1 (+ v_~k2~0_2 v_~m~0_3)) InVars {~k2~0=v_~k2~0_2, ~m~0=v_~m~0_3} OutVars{~k2~0=v_~k2~0_1, ~m~0=v_~m~0_3} AuxVars[] AssignedVars[~k2~0]" "[265] L53-->L53-1: Formula: (= v_~i2~0_4 |v_thread2Thread1of1ForFork1_#t~post4_1|) InVars {~i2~0=v_~i2~0_4} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|, ~i2~0=v_~i2~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4]" "[266] L53-1-->L53-2: Formula: (= v_~i2~0_1 (+ |v_thread2Thread1of1ForFork1_#t~post4_3| 1)) InVars {thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_3|} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_3|, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0]" "[267] L53-2-->L51-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4]" [2025-04-26 16:37:23,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:23,302 INFO L85 PathProgramCache]: Analyzing trace with hash -487792366, now seen corresponding path program 1 times [2025-04-26 16:37:23,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:37:23,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971812284] [2025-04-26 16:37:23,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:37:23,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:37:23,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-26 16:37:23,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-26 16:37:23,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:23,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:23,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:37:23,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-26 16:37:23,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-26 16:37:23,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:23,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:23,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:37:23,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash 277766343, now seen corresponding path program 1 times [2025-04-26 16:37:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:37:23,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352242300] [2025-04-26 16:37:23,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:37:23,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:37:23,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:37:23,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:37:23,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:23,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:23,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:37:23,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:37:23,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:37:23,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:23,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:37:23,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:37:23,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:23,348 INFO L85 PathProgramCache]: Analyzing trace with hash 814252630, now seen corresponding path program 1 times [2025-04-26 16:37:23,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:37:23,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703070861] [2025-04-26 16:37:23,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:37:23,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:37:23,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 16:37:23,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 16:37:23,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:23,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:37:23,538 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:37:23,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:37:23,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703070861] [2025-04-26 16:37:23,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703070861] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:37:23,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:37:23,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 16:37:23,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141713680] [2025-04-26 16:37:23,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:37:23,554 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:37:23,554 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:37:23,554 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:37:23,554 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:37:23,554 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:37:23,554 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:23,554 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:37:23,554 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:37:23,554 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_petrified1_Iteration4_Loop [2025-04-26 16:37:23,554 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:37:23,554 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:37:23,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:23,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:23,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:23,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:23,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:23,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:23,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:23,623 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:37:23,623 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:37:23,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:23,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:23,628 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:23,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:37:23,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:23,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:23,648 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:23,648 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_7=-1} Honda state: {v_rep#funAddr~thread1.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:23,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:23,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:23,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:23,656 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:23,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:37:23,658 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:23,658 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:23,675 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:23,675 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_7=-1} Honda state: {v_rep#funAddr~thread2.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:23,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:23,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:23,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:23,682 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:23,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:37:23,684 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:23,684 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:23,701 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:23,701 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_7=0} Honda state: {v_rep#funAddr~thread1.offset_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:23,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:23,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:23,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:23,708 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:23,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:37:23,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:23,710 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:23,722 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:23,722 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_#t~post4=0} Honda state: {thread2Thread1of1ForFork1_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:23,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 16:37:23,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:23,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:23,730 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:23,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:37:23,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:23,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:23,744 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:23,744 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~k2~0=0, ~m~0=0} Honda state: {~k2~0=0, ~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:23,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:23,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:23,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:23,751 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:23,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:37:23,753 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:23,753 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:23,770 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:37:23,770 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_7=1} Honda state: {v_rep#funAddr~thread2.offset_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:37:23,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:23,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:23,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:23,777 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:23,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:37:23,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:37:23,781 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:23,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:23,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:23,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:23,798 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:23,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:37:23,800 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:37:23,800 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:37:23,861 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:37:23,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:23,865 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:37:23,865 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:37:23,865 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:37:23,865 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:37:23,865 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:37:23,865 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:23,865 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:37:23,865 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:37:23,866 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.c_petrified1_Iteration4_Loop [2025-04-26 16:37:23,866 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:37:23,866 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:37:23,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:23,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:23,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:23,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:23,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:23,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:23,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:37:23,930 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:37:23,930 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:37:23,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:23,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:23,932 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:23,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:37:23,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:23,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:23,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:23,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:23,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:23,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:37:23,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:37:23,949 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:23,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:23,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:23,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:23,956 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:23,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:37:23,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:23,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:23,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:23,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:23,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:23,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:37:23,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:37:23,971 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:23,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 16:37:23,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:23,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:23,978 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:23,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:37:23,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:23,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:23,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:23,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:23,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:23,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:37:23,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:37:23,995 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:24,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:24,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:24,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:24,003 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:24,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 16:37:24,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:24,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:24,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:37:24,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:24,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:24,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:24,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:37:24,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:37:24,017 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:24,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:24,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:24,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:24,028 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:24,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 16:37:24,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:24,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:24,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:37:24,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:24,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:24,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:24,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:37:24,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:37:24,041 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:24,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:24,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:24,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:24,051 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:24,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 16:37:24,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:24,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:24,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:24,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:24,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:24,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:37:24,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:37:24,067 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:37:24,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 16:37:24,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:24,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:24,075 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:24,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 16:37:24,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:37:24,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:37:24,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:37:24,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:37:24,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:37:24,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:37:24,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:37:24,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:37:24,090 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:37:24,092 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:37:24,092 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:37:24,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:37:24,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:37:24,094 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:37:24,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 16:37:24,096 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:37:24,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-04-26 16:37:24,099 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:37:24,099 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:37:24,099 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i2~0, ~n~0) = -1*~i2~0 + 1*~n~0 Supporting invariants [] [2025-04-26 16:37:24,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-04-26 16:37:24,104 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:37:24,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:37:24,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-26 16:37:24,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-26 16:37:24,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:24,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:37:24,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:37:24,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:37:24,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:37:24,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:37:24,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:37:24,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:37:24,206 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:37:24,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:37:24,240 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:37:24,240 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:37:24,241 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 613 states and 860 transitions. cyclomatic complexity: 272 Second operand has 5 states, 5 states have (on average 14.0) internal successors, (in total 70), 5 states have internal predecessors, (70), 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:37:24,299 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 613 states and 860 transitions. cyclomatic complexity: 272. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (in total 70), 5 states have internal predecessors, (70), 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) Result 1045 states and 1501 transitions. Complement of second has 8 states. [2025-04-26 16:37:24,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:37:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (in total 70), 5 states have internal predecessors, (70), 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:37:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2025-04-26 16:37:24,300 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 149 transitions. Stem has 65 letters. Loop has 5 letters. [2025-04-26 16:37:24,301 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:37:24,301 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 149 transitions. Stem has 70 letters. Loop has 5 letters. [2025-04-26 16:37:24,301 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:37:24,301 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 149 transitions. Stem has 65 letters. Loop has 10 letters. [2025-04-26 16:37:24,301 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:37:24,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1045 states and 1501 transitions. [2025-04-26 16:37:24,305 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:37:24,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1045 states to 0 states and 0 transitions. [2025-04-26 16:37:24,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:37:24,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:37:24,306 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:37:24,306 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:37:24,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:37:24,306 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:37:24,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:37:24,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:37:24,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:37:24,306 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (in total 70), 6 states have internal predecessors, (70), 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:37:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:37:24,306 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:37:24,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:37:24,306 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:37:24,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:37:24,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:37:24,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:37:24,307 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:37:24,307 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:37:24,307 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:37:24,307 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:37:24,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:37:24,307 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:37:24,307 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:37:24,307 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:37:24,307 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:37:24,307 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:37:24,318 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:37:24,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:37:24 BoogieIcfgContainer [2025-04-26 16:37:24,319 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:37:24,319 INFO L158 Benchmark]: Toolchain (without parser) took 5609.45ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 109.7MB in the beginning and 177.9MB in the end (delta: -68.2MB). Peak memory consumption was 153.6MB. Max. memory is 8.0GB. [2025-04-26 16:37:24,319 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:37:24,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.16ms. Allocated memory is still 155.2MB. Free memory was 109.7MB in the beginning and 95.7MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:37:24,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.67ms. Allocated memory is still 155.2MB. Free memory was 95.7MB in the beginning and 94.9MB in the end (delta: 874.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:37:24,320 INFO L158 Benchmark]: Boogie Preprocessor took 19.07ms. Allocated memory is still 155.2MB. Free memory was 94.9MB in the beginning and 93.4MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:37:24,320 INFO L158 Benchmark]: RCFGBuilder took 252.70ms. Allocated memory is still 155.2MB. Free memory was 93.4MB in the beginning and 80.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:37:24,320 INFO L158 Benchmark]: BuchiAutomizer took 5075.65ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 79.9MB in the beginning and 177.9MB in the end (delta: -98.0MB). Peak memory consumption was 124.3MB. Max. memory is 8.0GB. [2025-04-26 16:37:24,321 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.75ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.16ms. Allocated memory is still 155.2MB. Free memory was 109.7MB in the beginning and 95.7MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.67ms. Allocated memory is still 155.2MB. Free memory was 95.7MB in the beginning and 94.9MB in the end (delta: 874.6kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.07ms. Allocated memory is still 155.2MB. Free memory was 94.9MB in the beginning and 93.4MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 252.70ms. Allocated memory is still 155.2MB. Free memory was 93.4MB in the beginning and 80.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 5075.65ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 79.9MB in the beginning and 177.9MB in the end (delta: -98.0MB). Peak memory consumption was 124.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.0s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 477 StatesRemovedByMinimization, 4 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 [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 800 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 794 mSDsluCounter, 1425 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 693 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 226 IncrementalHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 732 mSDtfsCounter, 226 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax285 hnf100 lsp24 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 270, Number of transitions in reduction automaton: 683, Number of states in reduction automaton: 532, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long long) -1 * i1) + n) and consists of 6 locations. One deterministic module has affine ranking function (((long long) -1 * j1) + m) and consists of 5 locations. One deterministic module has affine ranking function (((long long) -1 * i2) + n) and consists of 5 locations. One nondeterministic module has affine ranking function (((long long) -1 * j1) + m) and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:37:24,335 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...