./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cbd0b45e3a19519452fbcf6fd1c6a1f47a14b8d70acc30b1e21888135763cd85 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:22:32,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:22:32,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:22:32,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:22:32,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:22:32,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:22:32,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:22:32,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:22:32,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:22:32,174 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:22:32,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:22:32,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:22:32,175 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:22:32,175 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:22:32,176 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:22:32,176 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:22:32,176 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:22:32,180 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:22:32,181 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:22:32,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:22:32,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:22:32,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:22:32,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:22:32,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:22:32,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:22:32,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:22:32,186 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:22:32,186 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:22:32,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:22:32,186 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:22:32,187 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:22:32,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:22:32,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:22:32,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:22:32,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:22:32,188 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:22:32,189 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cbd0b45e3a19519452fbcf6fd1c6a1f47a14b8d70acc30b1e21888135763cd85 [2024-11-19 14:22:32,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:22:32,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:22:32,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:22:32,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:22:32,460 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:22:32,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca.i [2024-11-19 14:22:33,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:22:34,057 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:22:34,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca.i [2024-11-19 14:22:34,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1adaead1/751d9148f7514f08b67e02a10fc8258d/FLAG6200fe7f7 [2024-11-19 14:22:34,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1adaead1/751d9148f7514f08b67e02a10fc8258d [2024-11-19 14:22:34,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:22:34,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:22:34,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:22:34,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:22:34,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:22:34,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:22:34" (1/1) ... [2024-11-19 14:22:34,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32db43c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:22:34, skipping insertion in model container [2024-11-19 14:22:34,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:22:34" (1/1) ... [2024-11-19 14:22:34,128 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:22:34,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:22:34,423 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:22:34,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:22:34,489 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:22:34,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:22:34 WrapperNode [2024-11-19 14:22:34,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:22:34,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:22:34,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:22:34,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:22:34,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:22:34" (1/1) ... [2024-11-19 14:22:34,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:22:34" (1/1) ... [2024-11-19 14:22:34,528 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2024-11-19 14:22:34,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:22:34,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:22:34,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:22:34,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:22:34,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:22:34" (1/1) ... [2024-11-19 14:22:34,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:22:34" (1/1) ... [2024-11-19 14:22:34,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:22:34" (1/1) ... [2024-11-19 14:22:34,557 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-11-19 14:22:34,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:22:34" (1/1) ... [2024-11-19 14:22:34,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:22:34" (1/1) ... [2024-11-19 14:22:34,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:22:34" (1/1) ... [2024-11-19 14:22:34,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:22:34" (1/1) ... [2024-11-19 14:22:34,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:22:34" (1/1) ... [2024-11-19 14:22:34,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:22:34" (1/1) ... [2024-11-19 14:22:34,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:22:34,583 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:22:34,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:22:34,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:22:34,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:22:34" (1/1) ... [2024-11-19 14:22:34,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:34,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:34,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:34,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:22:34,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:22:34,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 14:22:34,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:22:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 14:22:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 14:22:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:22:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:22:34,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:22:34,748 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:22:34,750 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:22:34,913 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-19 14:22:34,914 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:22:34,923 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:22:34,924 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 14:22:34,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:22:34 BoogieIcfgContainer [2024-11-19 14:22:34,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:22:34,925 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:22:34,925 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:22:34,928 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:22:34,929 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:22:34,929 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:22:34" (1/3) ... [2024-11-19 14:22:34,929 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50b0df75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:22:34, skipping insertion in model container [2024-11-19 14:22:34,930 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:22:34,930 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:22:34" (2/3) ... [2024-11-19 14:22:34,930 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50b0df75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:22:34, skipping insertion in model container [2024-11-19 14:22:34,930 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:22:34,930 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:22:34" (3/3) ... [2024-11-19 14:22:34,931 INFO L332 chiAutomizerObserver]: Analyzing ICFG cstrcspn_reverse_alloca.i [2024-11-19 14:22:34,976 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:22:34,976 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:22:34,976 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:22:34,976 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:22:34,976 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:22:34,976 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:22:34,977 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:22:34,977 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:22:34,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:34,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:22:34,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:22:34,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:22:35,001 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:22:35,001 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:22:35,001 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:22:35,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:35,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:22:35,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:22:35,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:22:35,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:22:35,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:22:35,010 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 16#L382true assume !(main_~length1~0#1 < 1); 14#L382-2true assume !(main_~length2~0#1 < 1); 3#L385-1true call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem205#1, cstrcspn_#t~mem206#1, cstrcspn_#t~mem207#1, cstrcspn_#t~mem208#1, cstrcspn_#t~short209#1, cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset, cstrcspn_#t~mem211#1, cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 7#L369-4true [2024-11-19 14:22:35,013 INFO L747 eck$LassoCheckResult]: Loop: 7#L369-4true call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 15#L369-1true assume !!(0 != cstrcspn_#t~mem205#1);havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1; 5#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem211#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 19#L374true assume !(cstrcspn_#t~mem211#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem211#1; 8#L369-3true cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset - 1;havoc cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset; 7#L369-4true [2024-11-19 14:22:35,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:35,019 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2024-11-19 14:22:35,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:22:35,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611856722] [2024-11-19 14:22:35,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:22:35,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:22:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:35,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:22:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:35,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:22:35,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:35,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2024-11-19 14:22:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:22:35,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855136502] [2024-11-19 14:22:35,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:22:35,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:22:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:22:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:22:35,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:22:35,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855136502] [2024-11-19 14:22:35,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855136502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:22:35,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:22:35,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:22:35,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336804266] [2024-11-19 14:22:35,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:22:35,237 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:22:35,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:22:35,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 14:22:35,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 14:22:35,260 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:22:35,264 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-19 14:22:35,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2024-11-19 14:22:35,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:22:35,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2024-11-19 14:22:35,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-19 14:22:35,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-19 14:22:35,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2024-11-19 14:22:35,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:22:35,269 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-11-19 14:22:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2024-11-19 14:22:35,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-19 14:22:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2024-11-19 14:22:35,284 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-11-19 14:22:35,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 14:22:35,287 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-11-19 14:22:35,287 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:22:35,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2024-11-19 14:22:35,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:22:35,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:22:35,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:22:35,288 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:22:35,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:22:35,289 INFO L745 eck$LassoCheckResult]: Stem: 55#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 50#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 51#L382 assume !(main_~length1~0#1 < 1); 56#L382-2 assume !(main_~length2~0#1 < 1); 44#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem205#1, cstrcspn_#t~mem206#1, cstrcspn_#t~mem207#1, cstrcspn_#t~mem208#1, cstrcspn_#t~short209#1, cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset, cstrcspn_#t~mem211#1, cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 45#L369-4 [2024-11-19 14:22:35,289 INFO L747 eck$LassoCheckResult]: Loop: 45#L369-4 call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 52#L369-1 assume !!(0 != cstrcspn_#t~mem205#1);havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1; 48#L372-5 call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 0 != cstrcspn_#t~mem207#1; 49#L372-1 assume cstrcspn_#t~short209#1;call cstrcspn_#t~mem208#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := cstrcspn_#t~mem208#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1; 46#L372-6 call cstrcspn_#t~mem211#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 47#L374 assume !(cstrcspn_#t~mem211#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem211#1; 53#L369-3 cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset - 1;havoc cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset; 45#L369-4 [2024-11-19 14:22:35,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:35,289 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2024-11-19 14:22:35,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:22:35,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429530984] [2024-11-19 14:22:35,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:22:35,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:22:35,333 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:22:35,333 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:22:35,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:22:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:35,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:22:35,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:35,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2024-11-19 14:22:35,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:22:35,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368968579] [2024-11-19 14:22:35,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:22:35,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:22:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:35,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:22:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:35,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:22:35,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:35,400 INFO L85 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2024-11-19 14:22:35,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:22:35,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894900658] [2024-11-19 14:22:35,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:22:35,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:22:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:35,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:22:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:35,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:22:36,260 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:22:36,261 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:22:36,261 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:22:36,261 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:22:36,261 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:22:36,261 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:36,262 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:22:36,262 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:22:36,262 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca.i_Iteration2_Lasso [2024-11-19 14:22:36,262 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:22:36,263 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:22:36,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:36,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:37,300 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:22:37,305 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:22:37,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:37,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:37,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:37,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:22:37,318 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 [2024-11-19 14:22:37,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:37,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:22:37,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:37,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:37,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:37,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:22:37,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:22:37,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:37,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-19 14:22:37,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:37,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:37,358 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:37,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:22:37,363 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 [2024-11-19 14:22:37,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:37,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:37,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:37,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:37,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:22:37,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:22:37,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:37,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-19 14:22:37,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:37,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:37,416 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:37,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:22:37,424 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 [2024-11-19 14:22:37,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:37,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:22:37,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:37,436 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-11-19 14:22:37,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:37,440 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-19 14:22:37,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:22:37,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:37,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-19 14:22:37,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:37,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:37,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:37,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:22:37,467 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 [2024-11-19 14:22:37,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:37,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:37,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:37,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:37,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:22:37,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:22:37,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:37,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:22:37,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:37,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:37,506 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:37,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:22:37,509 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 [2024-11-19 14:22:37,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:37,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:37,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:37,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:37,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:22:37,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:22:37,524 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:37,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-19 14:22:37,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:37,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:37,544 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:37,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:22:37,547 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 [2024-11-19 14:22:37,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:37,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:37,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:37,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:37,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:22:37,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:22:37,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:37,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-19 14:22:37,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:37,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:37,577 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:37,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:22:37,580 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 [2024-11-19 14:22:37,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:37,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:37,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:37,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:37,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:22:37,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:22:37,602 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:22:37,622 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-19 14:22:37,622 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-19 14:22:37,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:37,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:37,628 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:37,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 14:22:37,634 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:22:37,647 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:22:37,648 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:22:37,648 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215#1.base)_1, ULTIMATE.start_cstrcspn_~sc1~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215#1.base)_1 + 2*ULTIMATE.start_cstrcspn_~sc1~0#1.offset Supporting invariants [] [2024-11-19 14:22:37,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-19 14:22:37,700 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2024-11-19 14:22:37,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-19 14:22:37,711 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-19 14:22:37,716 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sc1~0!offset [2024-11-19 14:22:37,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:22:37,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:22:37,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:22:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:22:37,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:22:37,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:22:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:22:37,875 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:22:37,878 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:37,930 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 28 transitions. Complement of second has 4 states. [2024-11-19 14:22:37,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:22:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2024-11-19 14:22:37,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2024-11-19 14:22:37,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:22:37,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2024-11-19 14:22:37,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:22:37,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2024-11-19 14:22:37,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:22:37,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2024-11-19 14:22:37,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:22:37,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2024-11-19 14:22:37,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-19 14:22:37,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:22:37,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2024-11-19 14:22:37,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:22:37,939 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-11-19 14:22:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2024-11-19 14:22:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-19 14:22:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2024-11-19 14:22:37,941 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-11-19 14:22:37,941 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-11-19 14:22:37,941 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:22:37,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2024-11-19 14:22:37,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:22:37,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:22:37,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:22:37,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:22:37,943 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:22:37,943 INFO L745 eck$LassoCheckResult]: Stem: 197#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 189#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 190#L382 assume !(main_~length1~0#1 < 1); 198#L382-2 assume !(main_~length2~0#1 < 1); 181#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem205#1, cstrcspn_#t~mem206#1, cstrcspn_#t~mem207#1, cstrcspn_#t~mem208#1, cstrcspn_#t~short209#1, cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset, cstrcspn_#t~mem211#1, cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 182#L369-4 call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 192#L369-1 assume !!(0 != cstrcspn_#t~mem205#1);havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1; 185#L372-5 [2024-11-19 14:22:37,943 INFO L747 eck$LassoCheckResult]: Loop: 185#L372-5 call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 0 != cstrcspn_#t~mem207#1; 186#L372-1 assume cstrcspn_#t~short209#1;call cstrcspn_#t~mem208#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := cstrcspn_#t~mem208#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 195#L372-3 assume !!cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1;cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset - 1; 185#L372-5 [2024-11-19 14:22:37,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2024-11-19 14:22:37,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:22:37,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310430015] [2024-11-19 14:22:37,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:22:37,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:22:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:37,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:22:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:38,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:22:38,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:38,011 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2024-11-19 14:22:38,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:22:38,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517458332] [2024-11-19 14:22:38,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:22:38,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:22:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:38,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:22:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:38,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:22:38,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:38,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2024-11-19 14:22:38,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:22:38,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578757652] [2024-11-19 14:22:38,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:22:38,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:22:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:38,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:22:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:38,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:22:38,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 14:22:38,575 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:22:38,575 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:22:38,575 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:22:38,575 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:22:38,575 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:22:38,575 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:38,576 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:22:38,576 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:22:38,576 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca.i_Iteration3_Lasso [2024-11-19 14:22:38,576 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:22:38,576 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:22:38,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:38,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:39,317 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:22:39,317 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:22:39,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:39,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:39,320 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:39,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-19 14:22:39,325 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 [2024-11-19 14:22:39,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:39,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:22:39,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:39,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:39,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:39,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:22:39,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:22:39,374 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:39,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-19 14:22:39,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:39,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:39,411 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:39,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 14:22:39,420 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 [2024-11-19 14:22:39,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:39,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:22:39,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:39,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:39,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:39,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:22:39,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:22:39,453 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:39,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-19 14:22:39,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:39,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:39,480 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:39,483 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 [2024-11-19 14:22:39,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 14:22:39,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:39,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:22:39,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:39,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:39,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:39,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:22:39,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:22:39,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:39,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-19 14:22:39,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:39,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:39,530 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:39,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 14:22:39,535 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 [2024-11-19 14:22:39,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:39,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:22:39,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:39,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:39,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:39,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:22:39,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:22:39,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:39,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-19 14:22:39,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:39,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:39,560 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:39,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:22:39,562 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 [2024-11-19 14:22:39,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:39,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:22:39,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:39,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:39,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:39,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:22:39,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:22:39,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:39,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-19 14:22:39,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:39,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:39,586 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:39,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 14:22:39,588 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 [2024-11-19 14:22:39,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:39,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:39,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:39,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:39,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:22:39,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:22:39,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:39,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-19 14:22:39,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:39,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:39,637 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:39,639 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 [2024-11-19 14:22:39,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 14:22:39,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:39,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:39,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:39,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:39,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:22:39,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:22:39,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:39,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-19 14:22:39,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:39,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:39,708 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:39,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-19 14:22:39,710 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 [2024-11-19 14:22:39,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:39,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:39,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:39,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:39,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:22:39,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:22:39,734 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:22:39,744 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-19 14:22:39,744 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-19 14:22:39,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:39,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:39,748 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:39,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-19 14:22:39,757 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:22:39,768 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:22:39,768 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:22:39,768 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0#1.offset) = 2*ULTIMATE.start_cstrcspn_~s~0#1.offset + 1 Supporting invariants [] [2024-11-19 14:22:39,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-19 14:22:39,809 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2024-11-19 14:22:39,811 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-11-19 14:22:39,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:22:39,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:22:39,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:22:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:22:39,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 14:22:39,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:22:39,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:22:39,916 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:22:39,917 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:39,951 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 46 transitions. Complement of second has 5 states. [2024-11-19 14:22:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:22:39,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-19 14:22:39,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2024-11-19 14:22:39,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:22:39,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2024-11-19 14:22:39,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:22:39,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 6 letters. [2024-11-19 14:22:39,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:22:39,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2024-11-19 14:22:39,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:22:39,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 25 states and 34 transitions. [2024-11-19 14:22:39,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:22:39,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:22:39,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2024-11-19 14:22:39,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:22:39,955 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-11-19 14:22:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2024-11-19 14:22:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-19 14:22:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2024-11-19 14:22:39,957 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 33 transitions. [2024-11-19 14:22:39,957 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2024-11-19 14:22:39,958 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:22:39,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2024-11-19 14:22:39,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:22:39,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:22:39,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:22:39,959 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:22:39,959 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:22:39,959 INFO L745 eck$LassoCheckResult]: Stem: 340#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 330#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 331#L382 assume !(main_~length1~0#1 < 1); 341#L382-2 assume !(main_~length2~0#1 < 1); 322#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem205#1, cstrcspn_#t~mem206#1, cstrcspn_#t~mem207#1, cstrcspn_#t~mem208#1, cstrcspn_#t~short209#1, cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset, cstrcspn_#t~mem211#1, cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 323#L369-4 call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 332#L369-1 assume !!(0 != cstrcspn_#t~mem205#1);havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1; 343#L372-5 call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 0 != cstrcspn_#t~mem207#1; 338#L372-1 assume !cstrcspn_#t~short209#1; 339#L372-3 assume !cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1; 324#L372-6 call cstrcspn_#t~mem211#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 325#L374 assume !(cstrcspn_#t~mem211#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem211#1; 336#L369-3 cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset - 1;havoc cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset; 333#L369-4 call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 334#L369-1 assume !!(0 != cstrcspn_#t~mem205#1);havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1; 326#L372-5 [2024-11-19 14:22:39,960 INFO L747 eck$LassoCheckResult]: Loop: 326#L372-5 call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 0 != cstrcspn_#t~mem207#1; 327#L372-1 assume cstrcspn_#t~short209#1;call cstrcspn_#t~mem208#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := cstrcspn_#t~mem208#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 337#L372-3 assume !!cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1;cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset - 1; 326#L372-5 [2024-11-19 14:22:39,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2024-11-19 14:22:39,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:22:39,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115331205] [2024-11-19 14:22:39,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:22:39,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:22:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:39,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:22:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:39,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:22:39,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:39,989 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2024-11-19 14:22:39,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:22:39,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648681995] [2024-11-19 14:22:39,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:22:39,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:22:39,998 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:22:39,999 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:22:39,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:22:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:40,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:22:40,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:40,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2024-11-19 14:22:40,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:22:40,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004233218] [2024-11-19 14:22:40,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:22:40,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:22:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:22:40,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:22:40,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:22:40,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004233218] [2024-11-19 14:22:40,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004233218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:22:40,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233859195] [2024-11-19 14:22:40,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:22:40,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:22:40,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:40,264 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:22:40,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 14:22:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:22:40,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 14:22:40,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:22:40,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 14:22:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:22:40,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:22:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:22:40,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233859195] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:22:40,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:22:40,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2024-11-19 14:22:40,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117277616] [2024-11-19 14:22:40,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:22:40,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:22:40,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 14:22:40,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-19 14:22:40,648 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:22:40,810 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-11-19 14:22:40,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. [2024-11-19 14:22:40,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:22:40,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 38 states and 47 transitions. [2024-11-19 14:22:40,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-19 14:22:40,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-19 14:22:40,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 47 transitions. [2024-11-19 14:22:40,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:22:40,816 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-19 14:22:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 47 transitions. [2024-11-19 14:22:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2024-11-19 14:22:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-11-19 14:22:40,821 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-11-19 14:22:40,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 14:22:40,822 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-11-19 14:22:40,823 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:22:40,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2024-11-19 14:22:40,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:22:40,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:22:40,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:22:40,825 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:22:40,827 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:22:40,827 INFO L745 eck$LassoCheckResult]: Stem: 540#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 530#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 531#L382 assume !(main_~length1~0#1 < 1); 541#L382-2 assume !(main_~length2~0#1 < 1); 522#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem205#1, cstrcspn_#t~mem206#1, cstrcspn_#t~mem207#1, cstrcspn_#t~mem208#1, cstrcspn_#t~short209#1, cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset, cstrcspn_#t~mem211#1, cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 523#L369-4 call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 532#L369-1 assume !!(0 != cstrcspn_#t~mem205#1);havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1; 546#L372-5 call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 0 != cstrcspn_#t~mem207#1; 538#L372-1 assume cstrcspn_#t~short209#1;call cstrcspn_#t~mem208#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := cstrcspn_#t~mem208#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 539#L372-3 assume !cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1; 524#L372-6 call cstrcspn_#t~mem211#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 525#L374 assume !(cstrcspn_#t~mem211#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem211#1; 536#L369-3 cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset - 1;havoc cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset; 533#L369-4 call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 534#L369-1 assume !!(0 != cstrcspn_#t~mem205#1);havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1; 526#L372-5 [2024-11-19 14:22:40,827 INFO L747 eck$LassoCheckResult]: Loop: 526#L372-5 call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 0 != cstrcspn_#t~mem207#1; 527#L372-1 assume cstrcspn_#t~short209#1;call cstrcspn_#t~mem208#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := cstrcspn_#t~mem208#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 537#L372-3 assume !!cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1;cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset - 1; 526#L372-5 [2024-11-19 14:22:40,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:40,828 INFO L85 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2024-11-19 14:22:40,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:22:40,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661815755] [2024-11-19 14:22:40,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:22:40,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:22:40,854 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:22:40,858 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:22:40,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:22:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:40,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:22:40,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:40,922 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2024-11-19 14:22:40,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:22:40,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411905306] [2024-11-19 14:22:40,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:22:40,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:22:40,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-19 14:22:40,933 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:22:40,936 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:22:40,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:22:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:40,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:22:40,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:40,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2024-11-19 14:22:40,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:22:40,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691313797] [2024-11-19 14:22:40,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:22:40,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:22:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:40,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:22:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:22:41,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:22:42,294 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:22:42,295 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:22:42,295 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:22:42,295 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:22:42,295 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:22:42,295 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:42,295 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:22:42,295 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:22:42,295 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca.i_Iteration5_Lasso [2024-11-19 14:22:42,295 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:22:42,295 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:22:42,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:42,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:22:43,857 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:22:43,857 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:22:43,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:43,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:43,859 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:43,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 14:22:43,864 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 [2024-11-19 14:22:43,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:43,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:22:43,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:43,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:43,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:43,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:22:43,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:22:43,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:43,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-19 14:22:43,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:43,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:43,887 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:43,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 14:22:43,888 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 [2024-11-19 14:22:43,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:43,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:22:43,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:43,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:43,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:43,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:22:43,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:22:43,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:43,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-19 14:22:43,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:43,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:43,912 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:43,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-19 14:22:43,914 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 [2024-11-19 14:22:43,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:43,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:22:43,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:43,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:43,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:43,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:22:43,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:22:43,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:43,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-19 14:22:43,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:43,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:43,938 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:43,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-19 14:22:43,939 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 [2024-11-19 14:22:43,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:43,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:22:43,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:43,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:43,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:43,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:22:43,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:22:43,951 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:43,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-19 14:22:43,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:43,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:43,963 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:43,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-19 14:22:43,964 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 [2024-11-19 14:22:43,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:43,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:43,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:43,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:43,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:22:43,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:22:43,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:43,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-19 14:22:43,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:43,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:43,993 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:43,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 14:22:43,994 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 [2024-11-19 14:22:44,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:44,004 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2024-11-19 14:22:44,004 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2024-11-19 14:22:44,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:44,084 INFO L401 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2024-11-19 14:22:44,084 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2024-11-19 14:22:44,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:44,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-19 14:22:44,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:44,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:44,239 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:44,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 14:22:44,240 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 [2024-11-19 14:22:44,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:44,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:44,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:44,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:44,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:22:44,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:22:44,260 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:44,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-19 14:22:44,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:44,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:44,272 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:44,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-19 14:22:44,274 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 [2024-11-19 14:22:44,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:44,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:44,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:44,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:44,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:22:44,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:22:44,290 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:44,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-19 14:22:44,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:44,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:44,301 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:44,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-19 14:22:44,304 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 [2024-11-19 14:22:44,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:44,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:44,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:44,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:44,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:22:44,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:22:44,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:44,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-19 14:22:44,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:44,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:44,328 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:44,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-19 14:22:44,330 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 [2024-11-19 14:22:44,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:44,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:44,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:44,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:44,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:22:44,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:22:44,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:44,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-19 14:22:44,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:44,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:44,356 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:44,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-19 14:22:44,360 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 [2024-11-19 14:22:44,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:44,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:44,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:44,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:44,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:22:44,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:22:44,378 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:22:44,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-19 14:22:44,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:44,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:44,394 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:44,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-19 14:22:44,399 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 [2024-11-19 14:22:44,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:22:44,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:22:44,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:22:44,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:22:44,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:22:44,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:22:44,429 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:22:44,458 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-19 14:22:44,459 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-19 14:22:44,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:22:44,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:22:44,461 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:22:44,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-19 14:22:44,464 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:22:44,480 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:22:44,480 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:22:44,481 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc216#1.base)_3) = 2*ULTIMATE.start_cstrcspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216#1.base)_3 Supporting invariants [] [2024-11-19 14:22:44,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-19 14:22:44,541 INFO L156 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2024-11-19 14:22:44,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-11-19 14:22:44,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-19 14:22:44,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-19 14:22:44,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:22:44,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:22:44,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:22:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:22:44,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:22:44,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:22:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:22:44,691 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-19 14:22:44,691 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:44,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-19 14:22:44,765 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 47 transitions. Complement of second has 6 states. [2024-11-19 14:22:44,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:22:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-11-19 14:22:44,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-19 14:22:44,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:22:44,766 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:22:44,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:22:44,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:22:44,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:22:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:22:44,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:22:44,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:22:44,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:22:44,882 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-19 14:22:44,882 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:44,912 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 47 transitions. Complement of second has 6 states. [2024-11-19 14:22:44,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:22:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-11-19 14:22:44,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-19 14:22:44,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:22:44,914 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:22:44,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:22:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:22:44,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:22:44,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:22:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:22:44,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:22:44,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:22:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:22:45,008 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-19 14:22:45,008 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:45,037 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 55 transitions. Complement of second has 5 states. [2024-11-19 14:22:45,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:22:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:22:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-19 14:22:45,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-19 14:22:45,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:22:45,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 18 letters. Loop has 3 letters. [2024-11-19 14:22:45,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:22:45,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 15 letters. Loop has 6 letters. [2024-11-19 14:22:45,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:22:45,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 55 transitions. [2024-11-19 14:22:45,040 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:22:45,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2024-11-19 14:22:45,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:22:45,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:22:45,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:22:45,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:22:45,041 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:22:45,041 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:22:45,041 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:22:45,041 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:22:45,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:22:45,041 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:22:45,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:22:45,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:22:45 BoogieIcfgContainer [2024-11-19 14:22:45,046 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:22:45,047 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:22:45,047 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:22:45,047 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:22:45,047 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:22:34" (3/4) ... [2024-11-19 14:22:45,049 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:22:45,050 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:22:45,050 INFO L158 Benchmark]: Toolchain (without parser) took 10961.69ms. Allocated memory was 186.6MB in the beginning and 287.3MB in the end (delta: 100.7MB). Free memory was 146.3MB in the beginning and 205.5MB in the end (delta: -59.2MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-11-19 14:22:45,050 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 100.7MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:22:45,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.85ms. Allocated memory is still 186.6MB. Free memory was 146.3MB in the beginning and 125.7MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 14:22:45,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.89ms. Allocated memory is still 186.6MB. Free memory was 125.7MB in the beginning and 123.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:22:45,051 INFO L158 Benchmark]: Boogie Preprocessor took 51.80ms. Allocated memory is still 186.6MB. Free memory was 123.7MB in the beginning and 121.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:22:45,051 INFO L158 Benchmark]: RCFGBuilder took 341.35ms. Allocated memory is still 186.6MB. Free memory was 121.6MB in the beginning and 147.3MB in the end (delta: -25.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 14:22:45,051 INFO L158 Benchmark]: BuchiAutomizer took 10121.58ms. Allocated memory was 186.6MB in the beginning and 287.3MB in the end (delta: 100.7MB). Free memory was 147.3MB in the beginning and 205.5MB in the end (delta: -58.2MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2024-11-19 14:22:45,051 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 287.3MB. Free memory is still 205.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:22:45,052 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.64ms. Allocated memory is still 100.7MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.85ms. Allocated memory is still 186.6MB. Free memory was 146.3MB in the beginning and 125.7MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.89ms. Allocated memory is still 186.6MB. Free memory was 125.7MB in the beginning and 123.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.80ms. Allocated memory is still 186.6MB. Free memory was 123.7MB in the beginning and 121.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 341.35ms. Allocated memory is still 186.6MB. Free memory was 121.6MB in the beginning and 147.3MB in the end (delta: -25.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 10121.58ms. Allocated memory was 186.6MB in the beginning and 287.3MB in the end (delta: 100.7MB). Free memory was 147.3MB in the beginning and 205.5MB in the end (delta: -58.2MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 287.3MB. Free memory is still 205.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sc1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 3 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 8.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 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, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 209 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 98 mSDtfsCounter, 121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital244 mio100 ax100 hnf100 lsp112 ukn70 mio100 lsp26 div192 bol100 ite100 ukn100 eq157 hnf94 smp66 dnf1056 smp24 tf100 neg100 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 230ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-19 14:22:45,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-19 14:22:45,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE