/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/test-easy11.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:33:00,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:33:00,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:33:00,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:33:00,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:33:00,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:33:00,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:33:00,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:33:00,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:33:00,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:33:00,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:33:00,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:33:00,414 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:33:00,414 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:33:00,414 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:33:00,414 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:33:00,414 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:33:00,414 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:33:00,414 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:33:00,414 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:33:00,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:33:00,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:33:00,415 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:33:00,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:33:00,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:33:00,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:33:00,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:33:00,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:33:00,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:33:00,415 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:33:00,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:33:00,415 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:33:00,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:33:00,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:33:00,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:33:00,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:33:00,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:33:00,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:33:00,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:33:00,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:33:00,416 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:33:00,416 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:33:00,416 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:33:00,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:33:00,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:33:00,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:33:00,645 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 18:33:00,645 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 18:33:00,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c [2025-04-26 18:33:01,878 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8f7d6d545/4b74cd1e481f4231abcaaaa22a81adcc/FLAG34f97689a [2025-04-26 18:33:02,068 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 18:33:02,068 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c [2025-04-26 18:33:02,074 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8f7d6d545/4b74cd1e481f4231abcaaaa22a81adcc/FLAG34f97689a [2025-04-26 18:33:02,928 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8f7d6d545/4b74cd1e481f4231abcaaaa22a81adcc [2025-04-26 18:33:02,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:33:02,931 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 18:33:02,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 18:33:02,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 18:33:02,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 18:33:02,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:33:02" (1/1) ... [2025-04-26 18:33:02,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e3ebb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:33:02, skipping insertion in model container [2025-04-26 18:33:02,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:33:02" (1/1) ... [2025-04-26 18:33:02,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 18:33:03,095 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/test-easy11.wvr.c[1841,1854] [2025-04-26 18:33:03,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:33:03,109 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 18:33:03,131 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/test-easy11.wvr.c[1841,1854] [2025-04-26 18:33:03,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:33:03,143 INFO L204 MainTranslator]: Completed translation [2025-04-26 18:33:03,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:33:03 WrapperNode [2025-04-26 18:33:03,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 18:33:03,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:33:03,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:33:03,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:33:03,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:33:03" (1/1) ... [2025-04-26 18:33:03,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:33:03" (1/1) ... [2025-04-26 18:33:03,165 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 40 [2025-04-26 18:33:03,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:33:03,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:33:03,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:33:03,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:33:03,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:33:03" (1/1) ... [2025-04-26 18:33:03,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:33:03" (1/1) ... [2025-04-26 18:33:03,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:33:03" (1/1) ... [2025-04-26 18:33:03,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:33:03" (1/1) ... [2025-04-26 18:33:03,173 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:33:03" (1/1) ... [2025-04-26 18:33:03,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:33:03" (1/1) ... [2025-04-26 18:33:03,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:33:03" (1/1) ... [2025-04-26 18:33:03,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:33:03" (1/1) ... [2025-04-26 18:33:03,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:33:03" (1/1) ... [2025-04-26 18:33:03,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:33:03,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:33:03,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:33:03,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:33:03,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:33:03" (1/1) ... [2025-04-26 18:33:03,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:33:03,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:03,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:33:03,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:33:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 18:33:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:33:03,224 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:33:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:33:03,224 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:33:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 18:33:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:33:03,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:33:03,225 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:33:03,279 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:33:03,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:33:03,371 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:33:03,372 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:33:03,378 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:33:03,378 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:33:03,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:33:03 BoogieIcfgContainer [2025-04-26 18:33:03,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:33:03,379 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:33:03,379 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:33:03,383 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:33:03,383 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:33:03,383 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 06:33:02" (1/3) ... [2025-04-26 18:33:03,384 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7425c869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:33:03, skipping insertion in model container [2025-04-26 18:33:03,384 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:33:03,384 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:33:03" (2/3) ... [2025-04-26 18:33:03,384 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7425c869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:33:03, skipping insertion in model container [2025-04-26 18:33:03,384 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:33:03,384 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:33:03" (3/3) ... [2025-04-26 18:33:03,385 INFO L376 chiAutomizerObserver]: Analyzing ICFG test-easy11.wvr.c [2025-04-26 18:33:03,436 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:33:03,465 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:33:03,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:33:03,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:03,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:33:03,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:33:03,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 168 flow [2025-04-26 18:33:03,541 INFO L116 PetriNetUnfolderBase]: 4/73 cut-off events. [2025-04-26 18:33:03,544 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:33:03,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 73 events. 4/73 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-04-26 18:33:03,549 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 168 flow [2025-04-26 18:33:03,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 73 transitions, 158 flow [2025-04-26 18:33:03,555 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 76 places, 73 transitions, 158 flow [2025-04-26 18:33:03,556 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 73 transitions, 158 flow [2025-04-26 18:33:03,589 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 480 states, 478 states have (on average 2.435146443514644) internal successors, (in total 1164), 479 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:33:03,591 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 480 states, 478 states have (on average 2.435146443514644) internal successors, (in total 1164), 479 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:33:03,593 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:33:03,678 WARN L140 AmpleReduction]: Number of pruned transitions: 354 [2025-04-26 18:33:03,678 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:33:03,678 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 41 [2025-04-26 18:33:03,678 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:63 [2025-04-26 18:33:03,678 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:232 [2025-04-26 18:33:03,678 WARN L145 AmpleReduction]: Times succ was already a loop node:5 [2025-04-26 18:33:03,678 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:52 [2025-04-26 18:33:03,678 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:33:03,679 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 337 states, 335 states have (on average 1.328358208955224) internal successors, (in total 445), 336 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:33:03,687 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:33:03,687 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:33:03,687 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:33:03,687 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:33:03,688 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:33:03,688 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:33:03,688 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:33:03,688 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:33:03,690 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 337 states, 335 states have (on average 1.328358208955224) internal successors, (in total 445), 336 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:33:03,706 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 172 [2025-04-26 18:33:03,706 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:33:03,706 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:33:03,711 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] [2025-04-26 18:33:03,711 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:33:03,711 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:33:03,712 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 337 states, 335 states have (on average 1.328358208955224) internal successors, (in total 445), 336 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:33:03,721 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 172 [2025-04-26 18:33:03,721 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:33:03,721 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:33:03,721 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] [2025-04-26 18:33:03,722 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:33:03,726 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[125] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[117] 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[]" "[134] 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[]" "[131] 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[]" "[107] L21-3-->L21-4: Formula: (and (= 18 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[155] L21-4-->L37: Formula: (= v_~X~0_3 0) InVars {} OutVars{~X~0=v_~X~0_3} AuxVars[] AssignedVars[~X~0]" "[140] L37-->L-1-1: Formula: (= v_~Y~0_5 0) InVars {} OutVars{~Y~0=v_~Y~0_5} AuxVars[] AssignedVars[~Y~0]" "[141] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[144] L-1-2-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~t2~0#1]" "[151] L62-->L62-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[135] L62-1-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[109] L64-->L64-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1]" "[142] L64-1-->L64-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_3| v_~X~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|, ~X~0=v_~X~0_4} AuxVars[] AssignedVars[~X~0]" "[161] L64-2-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1]" "[162] L65-->L65-1: Formula: (= (ite (<= v_~X~0_5 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {~X~0=v_~X~0_5} OutVars{~X~0=v_~X~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]" "[137] L65-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]" "[112] 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]" "[111] 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[]" "[122] L32-1-->L65-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]" "[124] L65-2-->L68: 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]" "[138] L68-->L68-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1]" "[113] L68-1-->L68-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[101] L68-2-->L68-3: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[191] L68-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thread1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[164] $Ultimate##0-->L40: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_1| v_thread1Thread1of1ForFork1_~_argptr.base_1) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_1| v_thread1Thread1of1ForFork1_~_argptr.offset_1)) InVars {thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_1, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_1, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_~_argptr.offset]" "[165] L40-->L41: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0]" "[166] L41-->L42-1: Formula: (= v_thread1Thread1of1ForFork1_~x~0_3 v_~X~0_1) InVars {~X~0=v_~X~0_1} OutVars{~X~0=v_~X~0_1, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_3} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0]" [2025-04-26 18:33:03,726 INFO L754 eck$LassoCheckResult]: Loop: "[168] L42-1-->L43: Formula: (< v_thread1Thread1of1ForFork1_~x~0_7 10000) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_7} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_7} AuxVars[] AssignedVars[]" "[170] L43-->L43-1: Formula: (= v_thread1Thread1of1ForFork1_~x~0_11 |v_thread1Thread1of1ForFork1_#t~post1_1|) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_11} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" "[172] L43-1-->L43-2: Formula: (= v_thread1Thread1of1ForFork1_~x~0_13 (+ |v_thread1Thread1of1ForFork1_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0]" "[174] L43-2-->L42-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1]" [2025-04-26 18:33:03,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:33:03,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1907455199, now seen corresponding path program 1 times [2025-04-26 18:33:03,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:33:03,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165165336] [2025-04-26 18:33:03,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:33:03,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:33:03,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:33:03,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:33:03,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:33:03,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:33:03,797 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:33:03,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:33:03,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:33:03,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:33:03,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:33:03,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:33:03,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:33:03,822 INFO L85 PathProgramCache]: Analyzing trace with hash 6097285, now seen corresponding path program 1 times [2025-04-26 18:33:03,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:33:03,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443715131] [2025-04-26 18:33:03,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:33:03,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:33:03,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:33:03,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:33:03,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:33:03,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:33:03,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:33:03,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:33:03,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:33:03,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:33:03,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:33:03,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:33:03,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:33:03,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1613825189, now seen corresponding path program 1 times [2025-04-26 18:33:03,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:33:03,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563096778] [2025-04-26 18:33:03,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:33:03,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:33:03,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 18:33:03,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 18:33:03,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:33:03,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:33:03,842 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:33:03,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 18:33:03,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 18:33:03,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:33:03,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:33:03,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:33:03,893 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:33:03,894 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:33:03,894 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:33:03,894 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:33:03,894 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:33:03,894 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:03,894 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:33:03,894 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:33:03,895 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_petrified1_Iteration1_Loop [2025-04-26 18:33:03,895 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:33:03,895 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:33:03,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:03,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:03,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:03,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:03,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:03,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:03,991 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:33:03,992 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:33:03,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:03,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:03,995 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 18:33:03,996 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 18:33:03,997 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:33:03,997 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:33:04,017 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:33:04,018 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 18:33:04,023 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 18:33:04,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:04,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:04,025 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 18:33:04,026 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 18:33:04,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:33:04,028 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:33:04,050 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:33:04,050 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 18:33:04,055 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 18:33:04,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:04,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:04,057 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 18:33:04,058 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 18:33:04,059 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:33:04,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:33:04,075 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 18:33:04,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:04,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:04,077 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 18:33:04,078 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 18:33:04,079 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:33:04,079 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:33:04,101 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:33:04,105 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 18:33:04,105 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:33:04,105 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:33:04,105 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:33:04,105 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:33:04,105 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:33:04,105 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:04,105 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:33:04,105 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:33:04,105 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_petrified1_Iteration1_Loop [2025-04-26 18:33:04,105 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:33:04,105 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:33:04,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:04,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:04,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:04,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:04,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:04,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:04,175 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:33:04,178 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:33:04,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:04,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:04,180 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 18:33:04,201 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 18:33:04,202 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 18:33:04,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:33:04,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:33:04,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:33:04,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:33:04,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:33:04,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:33:04,225 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:33:04,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:33:04,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:04,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:04,236 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 18:33:04,238 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 18:33:04,238 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 18:33:04,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:33:04,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:33:04,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:33:04,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:33:04,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:33:04,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:33:04,254 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:33:04,259 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 18:33:04,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:04,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:04,262 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 18:33:04,263 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 18:33:04,264 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 18:33:04,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:33:04,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:33:04,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:33:04,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:33:04,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:33:04,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:33:04,279 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:33:04,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:33:04,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:04,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:04,286 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 18:33:04,287 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 18:33:04,288 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 18:33:04,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:33:04,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:33:04,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:33:04,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:33:04,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:33:04,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:33:04,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:33:04,301 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:33:04,303 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:33:04,303 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:33:04,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:04,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:04,306 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 18:33:04,307 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 18:33:04,307 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:33:04,310 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 18:33:04,310 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:33:04,310 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:33:04,311 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~x~0) = -2*thread1Thread1of1ForFork1_~x~0 + 19999 Supporting invariants [] [2025-04-26 18:33:04,316 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 18:33:04,319 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:33:04,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:33:04,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:33:04,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:33:04,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:33:04,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:33:04,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:33:04,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:33:04,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:33:04,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:33:04,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:33:04,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:33:04,414 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:33:04,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:33:04,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:33:04,475 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 18:33:04,476 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 337 states, 335 states have (on average 1.328358208955224) internal successors, (in total 445), 336 states have internal predecessors, (445), 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 6.4) internal successors, (in total 32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:33:04,591 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 337 states, 335 states have (on average 1.328358208955224) internal successors, (in total 445), 336 states have internal predecessors, (445), 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 6.4) internal successors, (in total 32), 5 states have internal predecessors, (32), 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 955 states and 1298 transitions. Complement of second has 9 states. [2025-04-26 18:33:04,593 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 18:33:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (in total 32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:33:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2025-04-26 18:33:04,602 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 158 transitions. Stem has 28 letters. Loop has 4 letters. [2025-04-26 18:33:04,602 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:33:04,603 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 158 transitions. Stem has 32 letters. Loop has 4 letters. [2025-04-26 18:33:04,604 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:33:04,605 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 158 transitions. Stem has 28 letters. Loop has 8 letters. [2025-04-26 18:33:04,605 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:33:04,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 955 states and 1298 transitions. [2025-04-26 18:33:04,613 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:33:04,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 955 states to 272 states and 361 transitions. [2025-04-26 18:33:04,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2025-04-26 18:33:04,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2025-04-26 18:33:04,620 INFO L74 IsDeterministic]: Start isDeterministic. Operand 272 states and 361 transitions. [2025-04-26 18:33:04,620 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:33:04,620 INFO L218 hiAutomatonCegarLoop]: Abstraction has 272 states and 361 transitions. [2025-04-26 18:33:04,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states and 361 transitions. [2025-04-26 18:33:04,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 259. [2025-04-26 18:33:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 259 states have (on average 1.3436293436293436) internal successors, (in total 348), 258 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:33:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 348 transitions. [2025-04-26 18:33:04,646 INFO L240 hiAutomatonCegarLoop]: Abstraction has 259 states and 348 transitions. [2025-04-26 18:33:04,646 INFO L438 stractBuchiCegarLoop]: Abstraction has 259 states and 348 transitions. [2025-04-26 18:33:04,646 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:33:04,646 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 348 transitions. [2025-04-26 18:33:04,647 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:33:04,647 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:33:04,647 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:33:04,648 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] [2025-04-26 18:33:04,648 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:33:04,652 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[125] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[117] 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[]" "[134] 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[]" "[131] 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[]" "[107] L21-3-->L21-4: Formula: (and (= 18 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[155] L21-4-->L37: Formula: (= v_~X~0_3 0) InVars {} OutVars{~X~0=v_~X~0_3} AuxVars[] AssignedVars[~X~0]" "[140] L37-->L-1-1: Formula: (= v_~Y~0_5 0) InVars {} OutVars{~Y~0=v_~Y~0_5} AuxVars[] AssignedVars[~Y~0]" "[141] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[144] L-1-2-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~t2~0#1]" "[151] L62-->L62-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[135] L62-1-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[109] L64-->L64-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1]" "[142] L64-1-->L64-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_3| v_~X~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|, ~X~0=v_~X~0_4} AuxVars[] AssignedVars[~X~0]" "[161] L64-2-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1]" "[162] L65-->L65-1: Formula: (= (ite (<= v_~X~0_5 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {~X~0=v_~X~0_5} OutVars{~X~0=v_~X~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]" "[137] L65-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]" "[112] 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]" "[111] 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[]" "[122] L32-1-->L65-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]" "[124] L65-2-->L68: 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]" "[138] L68-->L68-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1]" "[113] L68-1-->L68-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[101] L68-2-->L68-3: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[191] L68-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_4| 0) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thread1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_4|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_4, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_4, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~x~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~_argptr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork1_thidvar0]" "[164] $Ultimate##0-->L40: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~_argptr.base_1| v_thread1Thread1of1ForFork1_~_argptr.base_1) (= |v_thread1Thread1of1ForFork1_#in~_argptr.offset_1| v_thread1Thread1of1ForFork1_~_argptr.offset_1)) InVars {thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork1_#in~_argptr.offset=|v_thread1Thread1of1ForFork1_#in~_argptr.offset_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_1, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_1, thread1Thread1of1ForFork1_#in~_argptr.base=|v_thread1Thread1of1ForFork1_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~_argptr.base, thread1Thread1of1ForFork1_~_argptr.offset]" "[165] L40-->L41: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0]" "[166] L41-->L42-1: Formula: (= v_thread1Thread1of1ForFork1_~x~0_3 v_~X~0_1) InVars {~X~0=v_~X~0_1} OutVars{~X~0=v_~X~0_1, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_3} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~x~0]" "[167] L42-1-->L45: Formula: (<= 10000 v_thread1Thread1of1ForFork1_~x~0_5) InVars {thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_5} OutVars{thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_5} AuxVars[] AssignedVars[]" "[169] L45-->L45-1: Formula: (= (+ v_thread1Thread1of1ForFork1_~x~0_9 v_~Y~0_2) v_~Y~0_1) InVars {~Y~0=v_~Y~0_2, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_9} OutVars{~Y~0=v_~Y~0_1, thread1Thread1of1ForFork1_~x~0=v_thread1Thread1of1ForFork1_~x~0_9} AuxVars[] AssignedVars[~Y~0]" "[171] L45-1-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset]" "[173] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L68-4-->L68-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1]" "[123] L68-5-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1]" "[104] L69-->L69-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1]" "[145] L69-1-->L69-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[121] L69-2-->L69-3: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_3| |v_ULTIMATE.start_main_~t2~0#1_3|) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[188] L69-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr.base_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_4, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_4|, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_4, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_16, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#in~_argptr.offset, thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_#in~_argptr.base, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_~_argptr.offset, thread2Thread1of1ForFork0_~x~1, thread2Thread1of1ForFork0_#t~post2]" "[175] $Ultimate##0-->L51: Formula: (and (= v_thread2Thread1of1ForFork0_~_argptr.offset_1 |v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|) (= v_thread2Thread1of1ForFork0_~_argptr.base_1 |v_thread2Thread1of1ForFork0_#in~_argptr.base_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_1, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset]" "[176] L51-->L52: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1]" "[177] L52-->L53-1: Formula: (= v_thread2Thread1of1ForFork0_~x~1_3 v_~X~0_2) InVars {~X~0=v_~X~0_2} OutVars{~X~0=v_~X~0_2, thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1]" [2025-04-26 18:33:04,652 INFO L754 eck$LassoCheckResult]: Loop: "[179] L53-1-->L54: Formula: (< v_thread2Thread1of1ForFork0_~x~1_7 10000) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_7} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_7} AuxVars[] AssignedVars[]" "[181] L54-->L54-1: Formula: (= |v_thread2Thread1of1ForFork0_#t~post2_1| v_thread2Thread1of1ForFork0_~x~1_11) InVars {thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_11} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_11, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post2]" "[183] L54-1-->L54-2: Formula: (= (+ |v_thread2Thread1of1ForFork0_#t~post2_3| 1) v_thread2Thread1of1ForFork0_~x~1_13) InVars {thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_3|} OutVars{thread2Thread1of1ForFork0_~x~1=v_thread2Thread1of1ForFork0_~x~1_13, thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~x~1]" "[185] L54-2-->L53-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~post2=|v_thread2Thread1of1ForFork0_#t~post2_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post2]" [2025-04-26 18:33:04,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:33:04,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1834470123, now seen corresponding path program 1 times [2025-04-26 18:33:04,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:33:04,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318909001] [2025-04-26 18:33:04,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:33:04,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:33:04,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-26 18:33:04,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-26 18:33:04,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:33:04,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:33:04,675 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:33:04,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-26 18:33:04,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-26 18:33:04,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:33:04,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:33:04,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:33:04,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:33:04,691 INFO L85 PathProgramCache]: Analyzing trace with hash 6435909, now seen corresponding path program 1 times [2025-04-26 18:33:04,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:33:04,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640305716] [2025-04-26 18:33:04,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:33:04,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:33:04,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:33:04,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:33:04,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:33:04,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:33:04,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:33:04,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:33:04,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:33:04,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:33:04,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:33:04,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:33:04,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:33:04,697 INFO L85 PathProgramCache]: Analyzing trace with hash 363231791, now seen corresponding path program 1 times [2025-04-26 18:33:04,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:33:04,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877070042] [2025-04-26 18:33:04,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:33:04,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:33:04,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-26 18:33:04,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-26 18:33:04,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:33:04,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:33:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:33:04,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:33:04,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877070042] [2025-04-26 18:33:04,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877070042] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:33:04,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:33:04,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 18:33:04,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192155310] [2025-04-26 18:33:04,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:33:04,870 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:33:04,870 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:33:04,875 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:33:04,875 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:33:04,875 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:33:04,875 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:04,875 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:33:04,875 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:33:04,875 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_petrified1_Iteration2_Loop [2025-04-26 18:33:04,875 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:33:04,875 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:33:04,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:04,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:04,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:04,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:04,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:04,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:04,940 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:33:04,940 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:33:04,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:04,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:04,943 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 18:33:04,944 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 18:33:04,945 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:33:04,946 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:33:04,963 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:33:04,963 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 18:33:04,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:33:04,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:04,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:04,970 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 18:33:04,971 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 18:33:04,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:33:04,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:33:04,989 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:33:04,989 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_3=-1} Honda state: {v_rep#funAddr~thread1.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:33:04,994 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 18:33:04,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:04,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:04,996 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 18:33:04,996 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 18:33:04,997 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:33:04,997 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:33:05,014 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:33:05,015 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_3=-1} Honda state: {v_rep#funAddr~thread2.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:33:05,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:33:05,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:05,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:05,022 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 18:33:05,023 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 18:33:05,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:33:05,024 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:33:05,041 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:33:05,041 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_3=0} Honda state: {v_rep#funAddr~thread1.offset_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:33:05,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:33:05,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:05,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:05,048 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 18:33:05,049 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 18:33:05,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:33:05,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:33:05,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:33:05,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:05,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:05,068 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 18:33:05,069 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 18:33:05,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:33:05,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:33:05,091 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:33:05,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:33:05,095 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:33:05,095 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:33:05,095 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:33:05,095 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:33:05,095 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:33:05,095 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:05,095 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:33:05,095 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:33:05,095 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_petrified1_Iteration2_Loop [2025-04-26 18:33:05,095 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:33:05,095 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:33:05,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:05,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:05,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:05,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:05,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:05,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:33:05,150 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:33:05,150 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:33:05,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:05,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:05,153 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 18:33:05,155 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 18:33:05,156 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 18:33:05,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:33:05,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:33:05,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:33:05,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:33:05,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:33:05,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:33:05,170 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:33:05,178 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 18:33:05,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:05,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:05,181 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 18:33:05,181 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 18:33:05,183 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 18:33:05,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:33:05,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:33:05,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:33:05,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:33:05,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:33:05,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:33:05,196 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:33:05,202 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 18:33:05,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:05,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:05,204 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 18:33:05,205 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 18:33:05,206 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 18:33:05,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:33:05,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:33:05,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:33:05,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:33:05,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:33:05,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:33:05,220 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:33:05,226 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 18:33:05,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:05,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:05,228 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 18:33:05,229 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 18:33:05,230 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 18:33:05,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:33:05,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:33:05,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:33:05,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:33:05,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:33:05,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:33:05,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:33:05,243 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:33:05,248 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 18:33:05,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:05,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:05,249 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 18:33:05,250 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 18:33:05,251 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 18:33:05,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:33:05,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:33:05,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:33:05,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:33:05,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:33:05,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:33:05,265 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:33:05,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:33:05,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:05,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:05,273 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 18:33:05,274 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 18:33:05,275 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 18:33:05,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:33:05,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:33:05,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:33:05,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:33:05,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:33:05,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:33:05,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:33:05,289 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:33:05,291 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:33:05,291 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:33:05,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:33:05,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:33:05,293 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 18:33:05,295 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 18:33:05,295 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:33:05,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 18:33:05,298 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:33:05,299 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:33:05,299 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~x~1) = -2*thread2Thread1of1ForFork0_~x~1 + 19999 Supporting invariants [] [2025-04-26 18:33:05,304 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 18:33:05,305 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:33:05,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:33:05,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-26 18:33:05,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-26 18:33:05,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:33:05,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:33:05,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:33:05,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:33:05,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:33:05,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:33:05,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:33:05,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:33:05,411 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:33:05,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:33:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:33:05,450 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 18:33:05,450 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 348 transitions. cyclomatic complexity: 111 Second operand has 5 states, 5 states have (on average 9.0) internal successors, (in total 45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:33:05,502 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259 states and 348 transitions. cyclomatic complexity: 111. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (in total 45), 5 states have internal predecessors, (45), 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 416 states and 572 transitions. Complement of second has 8 states. [2025-04-26 18:33:05,503 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 18:33:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (in total 45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:33:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2025-04-26 18:33:05,503 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 91 transitions. Stem has 41 letters. Loop has 4 letters. [2025-04-26 18:33:05,504 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:33:05,504 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 91 transitions. Stem has 45 letters. Loop has 4 letters. [2025-04-26 18:33:05,504 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:33:05,504 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 91 transitions. Stem has 41 letters. Loop has 8 letters. [2025-04-26 18:33:05,504 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:33:05,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 416 states and 572 transitions. [2025-04-26 18:33:05,506 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:33:05,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 416 states to 0 states and 0 transitions. [2025-04-26 18:33:05,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:33:05,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:33:05,506 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:33:05,507 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:33:05,507 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:33:05,507 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:33:05,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:33:05,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:33:05,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:33:05,509 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (in total 45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:33:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:33:05,510 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:33:05,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:33:05,510 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:33:05,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:33:05,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:33:05,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:33:05,510 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:33:05,510 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:33:05,510 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:33:05,510 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:33:05,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:33:05,511 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:33:05,511 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:33:05,511 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:33:05,511 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:33:05,511 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:33:05,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:33:05,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:33:05 BoogieIcfgContainer [2025-04-26 18:33:05,521 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:33:05,521 INFO L158 Benchmark]: Toolchain (without parser) took 2590.59ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 110.3MB in the end (delta: 7.2MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2025-04-26 18:33:05,522 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 163.6MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:33:05,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.22ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 104.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:33:05,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.30ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 102.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:33:05,522 INFO L158 Benchmark]: Boogie Preprocessor took 14.20ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 102.2MB in the end (delta: 640.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:33:05,522 INFO L158 Benchmark]: RCFGBuilder took 195.20ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 89.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:33:05,522 INFO L158 Benchmark]: BuchiAutomizer took 2141.96ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 110.3MB in the end (delta: -20.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:33:05,525 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.14ms. Allocated memory is still 163.6MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.22ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 104.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.30ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 102.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.20ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 102.2MB in the end (delta: 640.2kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 195.20ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 89.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2141.96ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 110.3MB in the end (delta: -20.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 317 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 146 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax419 hnf100 lsp23 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 46ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 217, Number of transitions in reduction automaton: 445, Number of states in reduction automaton: 337, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (19999 + ((long long) x * -2)) and consists of 6 locations. One deterministic module has affine ranking function (19999 + ((long long) x * -2)) and consists of 5 locations. 1 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 18:33:05,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...