./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f 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/array-memsafety/openbsd_cstrspn-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash e27d2e3e94b55a3b3138a7f2b03714931363cb725f69630c5958681cf34de99e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:44:51,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:44:51,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 22:44:51,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:44:51,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:44:51,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:44:52,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:44:52,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:44:52,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:44:52,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:44:52,029 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:44:52,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:44:52,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:44:52,032 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:44:52,033 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:44:52,033 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:44:52,033 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:44:52,034 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:44:52,034 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:44:52,034 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:44:52,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:44:52,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:44:52,039 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 22:44:52,039 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:44:52,040 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 22:44:52,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:44:52,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:44:52,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:44:52,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:44:52,041 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:44:52,041 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:44:52,041 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 22:44:52,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:44:52,041 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:44:52,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:44:52,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:44:52,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:44:52,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:44:52,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:44:52,043 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:44:52,043 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e27d2e3e94b55a3b3138a7f2b03714931363cb725f69630c5958681cf34de99e [2024-11-10 22:44:52,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:44:52,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:44:52,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:44:52,304 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:44:52,305 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:44:52,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2024-11-10 22:44:53,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:44:54,009 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:44:54,009 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2024-11-10 22:44:54,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f68b231/9bb97653e629421d8ca3f2ec771877db/FLAG992ee5a1f [2024-11-10 22:44:54,333 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f68b231/9bb97653e629421d8ca3f2ec771877db [2024-11-10 22:44:54,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:44:54,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:44:54,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:44:54,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:44:54,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:44:54,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:44:54" (1/1) ... [2024-11-10 22:44:54,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2acecc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:54, skipping insertion in model container [2024-11-10 22:44:54,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:44:54" (1/1) ... [2024-11-10 22:44:54,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:44:54,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:44:54,736 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:44:54,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:44:54,818 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:44:54,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:54 WrapperNode [2024-11-10 22:44:54,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:44:54,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:44:54,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:44:54,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:44:54,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:54" (1/1) ... [2024-11-10 22:44:54,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:54" (1/1) ... [2024-11-10 22:44:54,853 INFO L138 Inliner]: procedures = 117, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2024-11-10 22:44:54,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:44:54,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:44:54,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:44:54,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:44:54,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:54" (1/1) ... [2024-11-10 22:44:54,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:54" (1/1) ... [2024-11-10 22:44:54,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:54" (1/1) ... [2024-11-10 22:44:54,892 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2024-11-10 22:44:54,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:54" (1/1) ... [2024-11-10 22:44:54,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:54" (1/1) ... [2024-11-10 22:44:54,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:54" (1/1) ... [2024-11-10 22:44:54,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:54" (1/1) ... [2024-11-10 22:44:54,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:54" (1/1) ... [2024-11-10 22:44:54,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:54" (1/1) ... [2024-11-10 22:44:54,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:44:54,911 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:44:54,912 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:44:54,912 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:44:54,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:54" (1/1) ... [2024-11-10 22:44:54,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:54,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:54,951 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-10 22:44:54,957 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-10 22:44:54,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 22:44:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 22:44:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 22:44:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 22:44:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 22:44:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 22:44:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:44:55,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:44:55,124 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:44:55,126 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:44:55,286 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L547: havoc main_#t~ret14#1;call ULTIMATE.dealloc(main_#t~malloc8#1.base, main_#t~malloc8#1.offset);havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call ULTIMATE.dealloc(main_#t~malloc9#1.base, main_#t~malloc9#1.offset);havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset; [2024-11-10 22:44:55,307 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-10 22:44:55,307 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:44:55,322 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:44:55,325 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:44:55,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:44:55 BoogieIcfgContainer [2024-11-10 22:44:55,325 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:44:55,326 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:44:55,327 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:44:55,330 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:44:55,331 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:44:55,331 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:44:54" (1/3) ... [2024-11-10 22:44:55,332 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49837a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:44:55, skipping insertion in model container [2024-11-10 22:44:55,333 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:44:55,333 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:44:54" (2/3) ... [2024-11-10 22:44:55,333 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49837a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:44:55, skipping insertion in model container [2024-11-10 22:44:55,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:44:55,334 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:44:55" (3/3) ... [2024-11-10 22:44:55,336 INFO L332 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrspn-alloca-2.i [2024-11-10 22:44:55,389 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:44:55,389 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:44:55,390 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:44:55,390 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:44:55,391 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:44:55,391 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:44:55,392 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:44:55,392 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:44:55,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 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-10 22:44:55,415 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2024-11-10 22:44:55,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:55,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:55,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:44:55,420 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:55,420 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:44:55,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 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-10 22:44:55,424 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2024-11-10 22:44:55,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:55,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:55,424 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:44:55,425 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:55,429 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#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~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 10#L528true assume main_~length1~0#1 < 1;main_~length1~0#1 := 1; 7#L531true assume !(main_~length2~0#1 < 1); 4#L534true call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 6#L537-1true [2024-11-10 22:44:55,429 INFO L747 eck$LassoCheckResult]: Loop: 6#L537-1true assume true; 16#L537-2true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 6#L537-1true [2024-11-10 22:44:55,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash 61042717, now seen corresponding path program 1 times [2024-11-10 22:44:55,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:55,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126884329] [2024-11-10 22:44:55,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:55,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:55,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:55,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:55,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:55,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1792, now seen corresponding path program 1 times [2024-11-10 22:44:55,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:55,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488066932] [2024-11-10 22:44:55,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:55,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:55,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:55,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:55,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:55,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1467490276, now seen corresponding path program 1 times [2024-11-10 22:44:55,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:55,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084159836] [2024-11-10 22:44:55,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:55,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:55,865 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-10 22:44:55,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:44:55,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084159836] [2024-11-10 22:44:55,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084159836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:44:55,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:44:55,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:44:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764883616] [2024-11-10 22:44:55,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:44:55,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:44:56,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 22:44:56,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 22:44:56,013 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 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 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-10 22:44:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:44:56,055 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2024-11-10 22:44:56,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2024-11-10 22:44:56,059 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-11-10 22:44:56,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 30 transitions. [2024-11-10 22:44:56,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-10 22:44:56,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-10 22:44:56,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2024-11-10 22:44:56,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:44:56,066 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-10 22:44:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2024-11-10 22:44:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2024-11-10 22:44:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-10 22:44:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-11-10 22:44:56,096 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-10 22:44:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 22:44:56,101 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-10 22:44:56,101 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:44:56,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2024-11-10 22:44:56,102 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2024-11-10 22:44:56,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:56,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:56,102 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:44:56,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:56,103 INFO L745 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 61#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#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~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 72#L528 assume !(main_~length1~0#1 < 1); 67#L531 assume !(main_~length2~0#1 < 1); 62#L534 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 63#L537-1 [2024-11-10 22:44:56,103 INFO L747 eck$LassoCheckResult]: Loop: 63#L537-1 assume true; 66#L537-2 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 63#L537-1 [2024-11-10 22:44:56,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:56,104 INFO L85 PathProgramCache]: Analyzing trace with hash 61043678, now seen corresponding path program 1 times [2024-11-10 22:44:56,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:56,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495304203] [2024-11-10 22:44:56,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:56,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:56,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:56,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:56,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:56,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1792, now seen corresponding path program 2 times [2024-11-10 22:44:56,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:56,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260588656] [2024-11-10 22:44:56,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:56,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:56,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:56,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:56,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:56,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1466566755, now seen corresponding path program 1 times [2024-11-10 22:44:56,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:56,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158711045] [2024-11-10 22:44:56,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:56,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:56,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:56,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:56,643 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:44:56,644 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:44:56,645 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:44:56,645 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:44:56,645 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:44:56,646 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:56,646 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:44:56,646 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:44:56,647 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration2_Lasso [2024-11-10 22:44:56,647 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:44:56,647 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:44:56,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:56,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:56,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:56,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:56,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:56,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:56,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:56,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:56,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:56,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:56,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:56,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:56,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:56,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:56,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:56,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:57,322 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:44:57,326 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:44:57,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:57,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:57,330 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-10 22:44:57,331 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-10 22:44:57,333 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-10 22:44:57,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:57,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:57,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:57,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:57,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:57,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:57,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:57,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:57,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-10 22:44:57,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:57,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:57,374 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-10 22:44:57,376 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-10 22:44:57,377 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-10 22:44:57,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:57,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:57,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:57,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:57,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:57,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:57,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:57,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:57,408 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-10 22:44:57,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:57,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:57,410 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-10 22:44:57,411 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-10 22:44:57,414 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-10 22:44:57,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:57,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:57,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:57,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:57,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:57,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:57,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:57,453 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-10 22:44:57,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:57,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:57,456 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-10 22:44:57,457 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-10 22:44:57,458 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-10 22:44:57,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:57,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:57,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:57,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:57,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:57,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:57,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:57,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:57,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:57,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:57,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:57,495 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-10 22:44:57,496 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-10 22:44:57,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:57,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:57,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:57,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:57,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:57,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:57,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:57,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:57,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:57,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 22:44:57,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:57,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:57,531 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-10 22:44:57,533 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-10 22:44:57,534 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-10 22:44:57,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:57,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:57,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:57,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:57,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:57,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:57,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:57,552 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:57,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:57,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:57,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:57,566 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-10 22:44:57,566 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-10 22:44:57,567 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-10 22:44:57,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:57,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:57,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:57,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:57,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:57,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:57,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:57,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:57,595 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-10 22:44:57,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:57,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:57,597 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-10 22:44:57,599 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-10 22:44:57,600 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-10 22:44:57,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:57,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:57,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:57,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:57,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:57,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:57,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:57,631 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-10 22:44:57,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:57,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:57,633 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-10 22:44:57,634 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-10 22:44:57,635 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-10 22:44:57,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:57,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:57,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:57,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:57,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:57,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:57,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:57,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:57,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:57,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:57,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:57,662 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-10 22:44:57,662 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-10 22:44:57,663 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-10 22:44:57,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:57,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:57,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:57,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:57,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:57,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:57,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:57,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:57,686 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-10 22:44:57,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:57,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:57,689 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-10 22:44:57,690 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-10 22:44:57,690 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-10 22:44:57,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:57,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:57,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:57,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:57,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:57,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:57,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:57,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:57,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:57,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:57,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:57,716 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-10 22:44:57,717 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-10 22:44:57,718 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-10 22:44:57,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:57,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:57,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:57,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:57,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:57,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:57,752 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:44:57,792 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-10 22:44:57,792 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-10 22:44:57,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:57,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:57,818 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-10 22:44:57,820 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-10 22:44:57,821 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:44:57,839 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:44:57,839 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:44:57,840 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~length1~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~length1~0#1 Supporting invariants [] [2024-11-10 22:44:57,871 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-10 22:44:57,887 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-10 22:44:57,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:57,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:44:57,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:57,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:44:57,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:57,982 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-10 22:44:57,985 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 22:44:57,986 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10 22:44:58,018 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 22 states and 29 transitions. Complement of second has 5 states. [2024-11-10 22:44:58,022 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-10 22:44:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10 22:44:58,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2024-11-10 22:44:58,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-10 22:44:58,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:58,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2024-11-10 22:44:58,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:58,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-10 22:44:58,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:58,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2024-11-10 22:44:58,029 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-10 22:44:58,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 28 transitions. [2024-11-10 22:44:58,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-10 22:44:58,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-10 22:44:58,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2024-11-10 22:44:58,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:58,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-11-10 22:44:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2024-11-10 22:44:58,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-10 22:44:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 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-10 22:44:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2024-11-10 22:44:58,035 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-10 22:44:58,035 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-10 22:44:58,035 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:44:58,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2024-11-10 22:44:58,035 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-10 22:44:58,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:58,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:58,036 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:58,036 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:58,037 INFO L745 eck$LassoCheckResult]: Stem: 165#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 166#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#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~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 179#L528 assume !(main_~length1~0#1 < 1); 180#L531 assume !(main_~length2~0#1 < 1); 184#L534 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 183#L537-1 assume true; 171#L537-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 182#L537 havoc main_~i~0#1;main_~i~1#1 := 0; 169#L541-1 [2024-11-10 22:44:58,038 INFO L747 eck$LassoCheckResult]: Loop: 169#L541-1 assume true; 170#L541-2 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 169#L541-1 [2024-11-10 22:44:58,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:58,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1781070810, now seen corresponding path program 1 times [2024-11-10 22:44:58,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:58,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901483891] [2024-11-10 22:44:58,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:58,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:58,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:58,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:58,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:58,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1568, now seen corresponding path program 1 times [2024-11-10 22:44:58,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:58,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71685466] [2024-11-10 22:44:58,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:58,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:58,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:58,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:58,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:58,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2082902087, now seen corresponding path program 1 times [2024-11-10 22:44:58,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:58,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550375542] [2024-11-10 22:44:58,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:58,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:58,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:58,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:58,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:58,418 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:44:58,418 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:44:58,418 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:44:58,419 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:44:58,419 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:44:58,419 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:58,419 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:44:58,419 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:44:58,419 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration3_Lasso [2024-11-10 22:44:58,419 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:44:58,419 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:44:58,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:58,936 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:44:58,936 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:44:58,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:58,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:58,941 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-10 22:44:58,942 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-10 22:44:58,943 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-10 22:44:58,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:58,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:58,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:58,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:58,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:58,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:58,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:58,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:58,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-10 22:44:58,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:58,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:58,975 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-10 22:44:58,977 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-10 22:44:58,978 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-10 22:44:58,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:58,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:58,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:58,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:58,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:58,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:58,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:58,998 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:59,011 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-10 22:44:59,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:59,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:59,013 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-10 22:44:59,013 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-10 22:44:59,014 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-10 22:44:59,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:59,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:59,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:59,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:59,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:59,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:59,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:59,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:59,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:59,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:59,047 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-10 22:44:59,050 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-10 22:44:59,051 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-10 22:44:59,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:59,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:59,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:59,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:59,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:59,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:59,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:59,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:59,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:59,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:59,088 INFO L229 MonitoredProcess]: Starting monitored process 19 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-10 22:44:59,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-10 22:44:59,090 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-10 22:44:59,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:59,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:59,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:59,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:59,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:59,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:59,114 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:59,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-10 22:44:59,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:59,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:59,132 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-10 22:44:59,134 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-10 22:44:59,136 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-10 22:44:59,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:59,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:59,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:59,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:59,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:59,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:59,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:59,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:59,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-10 22:44:59,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:59,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:59,167 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-10 22:44:59,169 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-10 22:44:59,172 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-10 22:44:59,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:59,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:59,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:59,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:59,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:59,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:59,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:59,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:59,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:59,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:59,206 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-10 22:44:59,207 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-10 22:44:59,208 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-10 22:44:59,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:59,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:59,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:59,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:59,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:59,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:59,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:59,238 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-10 22:44:59,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:59,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:59,243 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-10 22:44:59,244 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-10 22:44:59,245 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-10 22:44:59,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:59,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:59,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:59,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:59,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:59,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:59,279 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:44:59,306 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-10 22:44:59,307 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-11-10 22:44:59,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:59,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:59,309 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-10 22:44:59,310 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-10 22:44:59,311 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:44:59,324 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:44:59,324 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:44:59,324 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length2~0#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~length2~0#1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2024-11-10 22:44:59,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-10 22:44:59,347 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-10 22:44:59,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:59,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:44:59,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:59,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:44:59,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:59,408 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-10 22:44:59,409 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 22:44:59,409 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10 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-10 22:44:59,419 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10. 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 22 states and 30 transitions. Complement of second has 5 states. [2024-11-10 22:44:59,420 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-10 22:44:59,421 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-10 22:44:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-10 22:44:59,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-10 22:44:59,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:59,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-10 22:44:59,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:59,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-10 22:44:59,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:59,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2024-11-10 22:44:59,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:44:59,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2024-11-10 22:44:59,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-10 22:44:59,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-10 22:44:59,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2024-11-10 22:44:59,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:59,425 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-10 22:44:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2024-11-10 22:44:59,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-10 22:44:59,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 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-10 22:44:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2024-11-10 22:44:59,429 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-10 22:44:59,429 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-10 22:44:59,429 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:44:59,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2024-11-10 22:44:59,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:44:59,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:59,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:59,432 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:59,432 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:44:59,433 INFO L745 eck$LassoCheckResult]: Stem: 280#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 281#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#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~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 296#L528 assume !(main_~length1~0#1 < 1); 297#L531 assume !(main_~length2~0#1 < 1); 301#L534 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 300#L537-1 assume true; 288#L537-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 299#L537 havoc main_~i~0#1;main_~i~1#1 := 0; 284#L541-1 assume true; 286#L541-2 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 298#L541 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset, cstrspn_#t~mem5#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset, cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset, cstrspn_~c~0#1, cstrspn_~sc~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset;havoc cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset;havoc cstrspn_~c~0#1;havoc cstrspn_~sc~0#1; 295#L522 [2024-11-10 22:44:59,433 INFO L747 eck$LassoCheckResult]: Loop: 295#L522 assume true;cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset;cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;call cstrspn_#t~mem3#1 := read~int#1(cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem3#1;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset; 292#L520 assume true;cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset := cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_#t~post4#1.base, 1 + cstrspn_#t~post4#1.offset;call cstrspn_#t~mem5#1 := read~int#0(cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset, 1);cstrspn_~sc~0#1 := cstrspn_#t~mem5#1; 293#L520-1 assume !!(0 != cstrspn_~sc~0#1);havoc cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset;havoc cstrspn_#t~mem5#1; 294#L521 assume cstrspn_~sc~0#1 == cstrspn_~c~0#1; 295#L522 [2024-11-10 22:44:59,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:59,433 INFO L85 PathProgramCache]: Analyzing trace with hash -145455305, now seen corresponding path program 1 times [2024-11-10 22:44:59,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:59,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281402433] [2024-11-10 22:44:59,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:59,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:59,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:59,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:59,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1321692, now seen corresponding path program 1 times [2024-11-10 22:44:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:59,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641934831] [2024-11-10 22:44:59,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:59,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:59,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:59,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:59,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:59,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1631181038, now seen corresponding path program 1 times [2024-11-10 22:44:59,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:59,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259083306] [2024-11-10 22:44:59,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:59,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:59,772 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-10 22:44:59,807 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-10 22:44:59,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:44:59,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259083306] [2024-11-10 22:44:59,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259083306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:44:59,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:44:59,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 22:44:59,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699379211] [2024-11-10 22:44:59,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:44:59,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:44:59,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 22:44:59,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 22:44:59,916 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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-10 22:44:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:44:59,977 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2024-11-10 22:44:59,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2024-11-10 22:44:59,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:44:59,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 30 transitions. [2024-11-10 22:44:59,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-10 22:44:59,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-10 22:44:59,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2024-11-10 22:44:59,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:59,981 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-10 22:44:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2024-11-10 22:44:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-10 22:44:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 states have internal predecessors, (29), 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-10 22:44:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-11-10 22:44:59,985 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-11-10 22:44:59,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 22:44:59,986 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-11-10 22:44:59,987 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:44:59,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2024-11-10 22:44:59,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:44:59,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:59,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:59,988 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:59,990 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:44:59,990 INFO L745 eck$LassoCheckResult]: Stem: 348#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 349#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#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~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 364#L528 assume !(main_~length1~0#1 < 1); 365#L531 assume !(main_~length2~0#1 < 1); 369#L534 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 368#L537-1 assume true; 356#L537-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 367#L537 havoc main_~i~0#1;main_~i~1#1 := 0; 352#L541-1 assume true; 353#L541-2 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 354#L541-1 assume true; 355#L541-2 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 366#L541 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset, cstrspn_#t~mem5#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset, cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset, cstrspn_~c~0#1, cstrspn_~sc~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset;havoc cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset;havoc cstrspn_~c~0#1;havoc cstrspn_~sc~0#1; 363#L522 [2024-11-10 22:44:59,990 INFO L747 eck$LassoCheckResult]: Loop: 363#L522 assume true;cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset;cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;call cstrspn_#t~mem3#1 := read~int#1(cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem3#1;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset; 360#L520 assume true;cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset := cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_#t~post4#1.base, 1 + cstrspn_#t~post4#1.offset;call cstrspn_#t~mem5#1 := read~int#0(cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset, 1);cstrspn_~sc~0#1 := cstrspn_#t~mem5#1; 361#L520-1 assume !!(0 != cstrspn_~sc~0#1);havoc cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset;havoc cstrspn_#t~mem5#1; 362#L521 assume cstrspn_~sc~0#1 == cstrspn_~c~0#1; 363#L522 [2024-11-10 22:44:59,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:59,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1951437560, now seen corresponding path program 1 times [2024-11-10 22:44:59,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:59,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944899058] [2024-11-10 22:44:59,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:59,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:00,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:00,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:00,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:00,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1321692, now seen corresponding path program 2 times [2024-11-10 22:45:00,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:00,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056254651] [2024-11-10 22:45:00,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:00,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:00,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:00,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:00,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:00,057 INFO L85 PathProgramCache]: Analyzing trace with hash -479958445, now seen corresponding path program 1 times [2024-11-10 22:45:00,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:00,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818480286] [2024-11-10 22:45:00,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:00,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 22:45:00,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:00,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818480286] [2024-11-10 22:45:00,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818480286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:00,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:00,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 22:45:00,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322278492] [2024-11-10 22:45:00,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:00,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:00,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 22:45:00,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 22:45:00,399 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 10 Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-10 22:45:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:00,449 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-11-10 22:45:00,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2024-11-10 22:45:00,450 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-10 22:45:00,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 42 transitions. [2024-11-10 22:45:00,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-11-10 22:45:00,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-11-10 22:45:00,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2024-11-10 22:45:00,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:00,452 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-10 22:45:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2024-11-10 22:45:00,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-10 22:45:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 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-10 22:45:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-11-10 22:45:00,458 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-10 22:45:00,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 22:45:00,459 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-10 22:45:00,459 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:45:00,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2024-11-10 22:45:00,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-10 22:45:00,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:00,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:00,460 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:00,460 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:45:00,461 INFO L745 eck$LassoCheckResult]: Stem: 419#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 420#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#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~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 437#L528 assume !(main_~length1~0#1 < 1); 432#L531 assume !(main_~length2~0#1 < 1); 421#L534 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 422#L537-1 assume true; 428#L537-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 441#L537 havoc main_~i~0#1;main_~i~1#1 := 0; 423#L541-1 assume true; 424#L541-2 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 425#L541-1 assume true; 426#L541-2 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 439#L541 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset, cstrspn_#t~mem5#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset, cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset, cstrspn_~c~0#1, cstrspn_~sc~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset;havoc cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset;havoc cstrspn_~c~0#1;havoc cstrspn_~sc~0#1; 440#L522 assume true;cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset;cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;call cstrspn_#t~mem3#1 := read~int#1(cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem3#1;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset; 436#L520 [2024-11-10 22:45:00,461 INFO L747 eck$LassoCheckResult]: Loop: 436#L520 assume true;cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset := cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_#t~post4#1.base, 1 + cstrspn_#t~post4#1.offset;call cstrspn_#t~mem5#1 := read~int#0(cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset, 1);cstrspn_~sc~0#1 := cstrspn_#t~mem5#1; 442#L520-1 assume !!(0 != cstrspn_~sc~0#1);havoc cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset;havoc cstrspn_#t~mem5#1; 435#L521 assume !(cstrspn_~sc~0#1 == cstrspn_~c~0#1); 436#L520 [2024-11-10 22:45:00,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:00,461 INFO L85 PathProgramCache]: Analyzing trace with hash 365022229, now seen corresponding path program 1 times [2024-11-10 22:45:00,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:00,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583146087] [2024-11-10 22:45:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:00,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:00,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:00,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:00,487 INFO L85 PathProgramCache]: Analyzing trace with hash 40680, now seen corresponding path program 1 times [2024-11-10 22:45:00,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:00,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663473507] [2024-11-10 22:45:00,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:00,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:00,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:00,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:00,495 INFO L85 PathProgramCache]: Analyzing trace with hash -479958444, now seen corresponding path program 1 times [2024-11-10 22:45:00,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:00,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876404893] [2024-11-10 22:45:00,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:00,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:00,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:00,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:01,236 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:45:01,237 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:45:01,237 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:45:01,237 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:45:01,237 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:45:01,237 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:01,237 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:45:01,237 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:45:01,237 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration6_Lasso [2024-11-10 22:45:01,237 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:45:01,237 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:45:01,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:01,920 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:45:01,920 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:45:01,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:01,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:01,922 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-10 22:45:01,924 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-10 22:45:01,924 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-10 22:45:01,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:01,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:01,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:01,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:01,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:01,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:01,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:01,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:01,954 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-10 22:45:01,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:01,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:01,957 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-10 22:45:01,959 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-10 22:45:01,960 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-10 22:45:01,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:01,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:01,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:01,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:01,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:01,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:01,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:01,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:01,990 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-10 22:45:01,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:01,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:01,992 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-10 22:45:01,994 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-10 22:45:01,995 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-10 22:45:02,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:02,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:02,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:02,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:02,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:02,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:02,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:02,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:02,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-10 22:45:02,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:02,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:02,028 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-10 22:45:02,029 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-10 22:45:02,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:02,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:02,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:02,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:02,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:02,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:02,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:02,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:02,044 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:02,055 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-10 22:45:02,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:02,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:02,056 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-10 22:45:02,057 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-10 22:45:02,058 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-10 22:45:02,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:02,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:02,068 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-11-10 22:45:02,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:02,081 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2024-11-10 22:45:02,081 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2024-11-10 22:45:02,111 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:02,126 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-10 22:45:02,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:02,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:02,129 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-10 22:45:02,130 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-10 22:45:02,131 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-10 22:45:02,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:02,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:02,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:02,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:02,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:02,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:02,153 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:02,170 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-10 22:45:02,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:02,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:02,174 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-10 22:45:02,176 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-10 22:45:02,177 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-10 22:45:02,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:02,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:02,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:02,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:02,192 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:02,192 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:02,196 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:02,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:02,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:02,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:02,211 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-10 22:45:02,212 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-10 22:45:02,213 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-10 22:45:02,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:02,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:02,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:02,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:02,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:02,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:02,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:02,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:02,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:02,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:02,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:02,236 INFO L229 MonitoredProcess]: Starting monitored process 33 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-10 22:45:02,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-10 22:45:02,237 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-10 22:45:02,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:02,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:02,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:02,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:02,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:02,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:02,259 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:45:02,274 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-10 22:45:02,274 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-10 22:45:02,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:02,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:02,276 INFO L229 MonitoredProcess]: Starting monitored process 34 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-10 22:45:02,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-10 22:45:02,278 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:45:02,291 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:45:02,292 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:45:02,292 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_3, ULTIMATE.start_cstrspn_~spanp~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_3 - 1*ULTIMATE.start_cstrspn_~spanp~0#1.offset Supporting invariants [] [2024-11-10 22:45:02,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-10 22:45:02,328 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2024-11-10 22:45:02,331 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~spanp~0!offset [2024-11-10 22:45:02,332 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-10 22:45:02,332 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-10 22:45:02,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:02,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 22:45:02,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:02,444 WARN L253 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 22:45:02,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:02,478 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-10 22:45:02,479 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-10 22:45:02,479 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-10 22:45:02,514 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 13. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 45 states and 54 transitions. Complement of second has 7 states. [2024-11-10 22:45:02,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:45:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-10 22:45:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2024-11-10 22:45:02,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 3 letters. [2024-11-10 22:45:02,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:02,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 17 letters. Loop has 3 letters. [2024-11-10 22:45:02,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:02,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 6 letters. [2024-11-10 22:45:02,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:02,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2024-11-10 22:45:02,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:45:02,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 26 states and 31 transitions. [2024-11-10 22:45:02,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-10 22:45:02,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-10 22:45:02,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2024-11-10 22:45:02,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:02,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-10 22:45:02,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2024-11-10 22:45:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-10 22:45:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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-10 22:45:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-10 22:45:02,520 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-10 22:45:02,521 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-10 22:45:02,521 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:45:02,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2024-11-10 22:45:02,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 22:45:02,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:02,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:02,522 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:02,522 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:45:02,522 INFO L745 eck$LassoCheckResult]: Stem: 619#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 620#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#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~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 638#L528 assume !(main_~length1~0#1 < 1); 630#L531 assume !(main_~length2~0#1 < 1); 625#L534 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 626#L537-1 assume true; 627#L537-2 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 628#L537-1 assume true; 629#L537-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 641#L537 havoc main_~i~0#1;main_~i~1#1 := 0; 621#L541-1 assume true; 622#L541-2 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 623#L541-1 assume true; 624#L541-2 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 639#L541 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset, cstrspn_#t~mem5#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset, cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset, cstrspn_~c~0#1, cstrspn_~sc~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset;havoc cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset;havoc cstrspn_~c~0#1;havoc cstrspn_~sc~0#1; 640#L522 assume true;cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset;cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;call cstrspn_#t~mem3#1 := read~int#1(cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem3#1;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset; 643#L520 assume true;cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset := cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_#t~post4#1.base, 1 + cstrspn_#t~post4#1.offset;call cstrspn_#t~mem5#1 := read~int#0(cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset, 1);cstrspn_~sc~0#1 := cstrspn_#t~mem5#1; 634#L520-1 assume !!(0 != cstrspn_~sc~0#1);havoc cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset;havoc cstrspn_#t~mem5#1; 635#L521 assume cstrspn_~sc~0#1 == cstrspn_~c~0#1; 636#L522 [2024-11-10 22:45:02,522 INFO L747 eck$LassoCheckResult]: Loop: 636#L522 assume true;cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset;cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;call cstrspn_#t~mem3#1 := read~int#1(cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem3#1;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset; 631#L520 assume true;cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset := cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_#t~post4#1.base, 1 + cstrspn_#t~post4#1.offset;call cstrspn_#t~mem5#1 := read~int#0(cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset, 1);cstrspn_~sc~0#1 := cstrspn_#t~mem5#1; 632#L520-1 assume !!(0 != cstrspn_~sc~0#1);havoc cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset;havoc cstrspn_#t~mem5#1; 642#L521 assume cstrspn_~sc~0#1 == cstrspn_~c~0#1; 636#L522 [2024-11-10 22:45:02,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:02,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1385412718, now seen corresponding path program 1 times [2024-11-10 22:45:02,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:02,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975790197] [2024-11-10 22:45:02,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:02,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:02,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:02,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:02,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:02,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1321692, now seen corresponding path program 3 times [2024-11-10 22:45:02,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:02,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391091557] [2024-11-10 22:45:02,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:02,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:02,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:02,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:02,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:02,573 INFO L85 PathProgramCache]: Analyzing trace with hash 134234605, now seen corresponding path program 2 times [2024-11-10 22:45:02,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:02,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406644601] [2024-11-10 22:45:02,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:02,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:02,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-10 22:45:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 22:45:02,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:02,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406644601] [2024-11-10 22:45:02,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406644601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:45:02,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882987294] [2024-11-10 22:45:02,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:45:02,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:45:02,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:02,935 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:45:02,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-10 22:45:03,021 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:45:03,021 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:45:03,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 22:45:03,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:03,103 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 13 treesize of output 9 [2024-11-10 22:45:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 22:45:03,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:45:03,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-10 22:45:03,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-10 22:45:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 22:45:03,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882987294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:45:03,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:45:03,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-10 22:45:03,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306233393] [2024-11-10 22:45:03,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:45:03,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:03,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 22:45:03,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-10 22:45:03,326 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. cyclomatic complexity: 9 Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 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-10 22:45:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:03,418 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-11-10 22:45:03,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 53 transitions. [2024-11-10 22:45:03,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-10 22:45:03,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 53 transitions. [2024-11-10 22:45:03,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-11-10 22:45:03,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-11-10 22:45:03,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 53 transitions. [2024-11-10 22:45:03,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:03,420 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-11-10 22:45:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 53 transitions. [2024-11-10 22:45:03,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-11-10 22:45:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 43 states have internal predecessors, (52), 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-10 22:45:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-11-10 22:45:03,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-11-10 22:45:03,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 22:45:03,424 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-11-10 22:45:03,424 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 22:45:03,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2024-11-10 22:45:03,425 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-10 22:45:03,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:03,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:03,425 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:03,425 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:45:03,426 INFO L745 eck$LassoCheckResult]: Stem: 845#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 846#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#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~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 864#L528 assume !(main_~length1~0#1 < 1); 857#L531 assume !(main_~length2~0#1 < 1); 847#L534 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 848#L537-1 assume true; 853#L537-2 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 854#L537-1 assume true; 856#L537-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 871#L537 havoc main_~i~0#1;main_~i~1#1 := 0; 849#L541-1 assume true; 850#L541-2 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 851#L541-1 assume true; 852#L541-2 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 872#L541 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset, cstrspn_#t~mem5#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset, cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset, cstrspn_~c~0#1, cstrspn_~sc~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset;havoc cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset;havoc cstrspn_~c~0#1;havoc cstrspn_~sc~0#1; 881#L522 assume true;cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset;cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;call cstrspn_#t~mem3#1 := read~int#1(cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem3#1;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset; 880#L520 assume true;cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset := cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_#t~post4#1.base, 1 + cstrspn_#t~post4#1.offset;call cstrspn_#t~mem5#1 := read~int#0(cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset, 1);cstrspn_~sc~0#1 := cstrspn_#t~mem5#1; 869#L520-1 assume !!(0 != cstrspn_~sc~0#1);havoc cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset;havoc cstrspn_#t~mem5#1; 861#L521 assume cstrspn_~sc~0#1 == cstrspn_~c~0#1; 862#L522 assume true;cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset;cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;call cstrspn_#t~mem3#1 := read~int#1(cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem3#1;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset; 873#L520 [2024-11-10 22:45:03,426 INFO L747 eck$LassoCheckResult]: Loop: 873#L520 assume true;cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset := cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_#t~post4#1.base, 1 + cstrspn_#t~post4#1.offset;call cstrspn_#t~mem5#1 := read~int#0(cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset, 1);cstrspn_~sc~0#1 := cstrspn_#t~mem5#1; 867#L520-1 assume !!(0 != cstrspn_~sc~0#1);havoc cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset;havoc cstrspn_#t~mem5#1; 868#L521 assume !(cstrspn_~sc~0#1 == cstrspn_~c~0#1); 873#L520 [2024-11-10 22:45:03,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:03,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1878715, now seen corresponding path program 3 times [2024-11-10 22:45:03,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:03,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011157647] [2024-11-10 22:45:03,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:03,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:03,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:03,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:03,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:03,460 INFO L85 PathProgramCache]: Analyzing trace with hash 40680, now seen corresponding path program 2 times [2024-11-10 22:45:03,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:03,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832842839] [2024-11-10 22:45:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:03,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:03,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:03,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:03,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash 134234606, now seen corresponding path program 1 times [2024-11-10 22:45:03,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:03,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007794934] [2024-11-10 22:45:03,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:03,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:03,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:03,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:05,317 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:45:05,317 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:45:05,317 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:45:05,318 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:45:05,318 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:45:05,318 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:05,318 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:45:05,318 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:45:05,318 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration8_Lasso [2024-11-10 22:45:05,318 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:45:05,318 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:45:05,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,114 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:45:06,115 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:45:06,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,117 INFO L229 MonitoredProcess]: Starting monitored process 36 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-10 22:45:06,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-10 22:45:06,118 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-10 22:45:06,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:06,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:06,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:06,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,145 INFO L229 MonitoredProcess]: Starting monitored process 37 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-10 22:45:06,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-10 22:45:06,147 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-10 22:45:06,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:06,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:06,163 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:06,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,174 INFO L229 MonitoredProcess]: Starting monitored process 38 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-10 22:45:06,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-10 22:45:06,175 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-10 22:45:06,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:06,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:06,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:06,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,203 INFO L229 MonitoredProcess]: Starting monitored process 39 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-10 22:45:06,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-10 22:45:06,204 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-10 22:45:06,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:06,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:06,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:06,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,234 INFO L229 MonitoredProcess]: Starting monitored process 40 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-10 22:45:06,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-10 22:45:06,236 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-10 22:45:06,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:06,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:06,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-10 22:45:06,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,272 INFO L229 MonitoredProcess]: Starting monitored process 41 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-10 22:45:06,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-10 22:45:06,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-10 22:45:06,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:06,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:06,292 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:06,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,303 INFO L229 MonitoredProcess]: Starting monitored process 42 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-10 22:45:06,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-10 22:45:06,305 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-10 22:45:06,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:06,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:06,319 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:06,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,330 INFO L229 MonitoredProcess]: Starting monitored process 43 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-10 22:45:06,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-10 22:45:06,332 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-10 22:45:06,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,343 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-10 22:45:06,343 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-11-10 22:45:06,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,386 INFO L401 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2024-11-10 22:45:06,386 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2024-11-10 22:45:06,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-10 22:45:06,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,471 INFO L229 MonitoredProcess]: Starting monitored process 44 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-10 22:45:06,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-10 22:45:06,472 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-10 22:45:06,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:06,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:06,486 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:06,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,498 INFO L229 MonitoredProcess]: Starting monitored process 45 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-10 22:45:06,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-10 22:45:06,499 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-10 22:45:06,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:06,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:06,518 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:45:06,527 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-10 22:45:06,527 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-10 22:45:06,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,529 INFO L229 MonitoredProcess]: Starting monitored process 46 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-10 22:45:06,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-10 22:45:06,530 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:45:06,540 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:45:06,541 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:45:06,541 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~spanp~0#1.base)_2, ULTIMATE.start_cstrspn_~spanp~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~spanp~0#1.base)_2 - 1*ULTIMATE.start_cstrspn_~spanp~0#1.offset Supporting invariants [] [2024-11-10 22:45:06,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:06,580 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2024-11-10 22:45:06,582 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~spanp~0!offset [2024-11-10 22:45:06,582 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-10 22:45:06,582 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-10 22:45:06,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:06,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:45:06,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:06,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:45:06,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:06,689 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-10 22:45:06,690 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-10 22:45:06,690 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 52 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10 22:45:06,701 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 52 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 53 states and 61 transitions. Complement of second has 5 states. [2024-11-10 22:45:06,702 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-10 22:45:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10 22:45:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2024-11-10 22:45:06,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 20 letters. Loop has 3 letters. [2024-11-10 22:45:06,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:06,706 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:45:06,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:06,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:45:06,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:06,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:45:06,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:06,799 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-10 22:45:06,800 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 22:45:06,800 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 52 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10 22:45:06,817 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 52 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 53 states and 63 transitions. Complement of second has 5 states. [2024-11-10 22:45:06,819 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-10 22:45:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10 22:45:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2024-11-10 22:45:06,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 20 letters. Loop has 3 letters. [2024-11-10 22:45:06,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:06,820 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:45:06,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:06,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:45:06,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:06,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:45:06,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:06,917 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-10 22:45:06,917 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 22:45:06,917 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 52 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10 22:45:06,932 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 52 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 58 states and 67 transitions. Complement of second has 4 states. [2024-11-10 22:45:06,933 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-10 22:45:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10 22:45:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2024-11-10 22:45:06,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 20 letters. Loop has 3 letters. [2024-11-10 22:45:06,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:06,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 23 letters. Loop has 3 letters. [2024-11-10 22:45:06,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:06,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 20 letters. Loop has 6 letters. [2024-11-10 22:45:06,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:06,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 67 transitions. [2024-11-10 22:45:06,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-10 22:45:06,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 29 states and 34 transitions. [2024-11-10 22:45:06,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-10 22:45:06,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-10 22:45:06,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2024-11-10 22:45:06,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:06,937 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-10 22:45:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2024-11-10 22:45:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2024-11-10 22:45:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 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-10 22:45:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-10 22:45:06,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-10 22:45:06,938 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-10 22:45:06,939 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-10 22:45:06,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2024-11-10 22:45:06,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-10 22:45:06,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:06,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:06,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:06,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:45:06,940 INFO L745 eck$LassoCheckResult]: Stem: 1341#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1342#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#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~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1359#L528 assume !(main_~length1~0#1 < 1); 1352#L531 assume !(main_~length2~0#1 < 1); 1343#L534 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 1344#L537-1 assume true; 1349#L537-2 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1350#L537-1 assume true; 1351#L537-2 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1363#L537-1 assume true; 1361#L537-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1362#L537 havoc main_~i~0#1;main_~i~1#1 := 0; 1345#L541-1 assume true; 1346#L541-2 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 1347#L541-1 assume true; 1348#L541-2 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1360#L541 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset, cstrspn_#t~mem5#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset, cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset, cstrspn_~c~0#1, cstrspn_~sc~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset;havoc cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset;havoc cstrspn_~c~0#1;havoc cstrspn_~sc~0#1; 1357#L522 [2024-11-10 22:45:06,940 INFO L747 eck$LassoCheckResult]: Loop: 1357#L522 assume true;cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset;cstrspn_~p~0#1.base, cstrspn_~p~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;call cstrspn_#t~mem3#1 := read~int#1(cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem3#1;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset; 1353#L520 assume true;cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset := cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset;cstrspn_~spanp~0#1.base, cstrspn_~spanp~0#1.offset := cstrspn_#t~post4#1.base, 1 + cstrspn_#t~post4#1.offset;call cstrspn_#t~mem5#1 := read~int#0(cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset, 1);cstrspn_~sc~0#1 := cstrspn_#t~mem5#1; 1354#L520-1 assume !!(0 != cstrspn_~sc~0#1);havoc cstrspn_#t~post4#1.base, cstrspn_#t~post4#1.offset;havoc cstrspn_#t~mem5#1; 1356#L521 assume cstrspn_~sc~0#1 == cstrspn_~c~0#1; 1357#L522 [2024-11-10 22:45:06,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:06,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1739262134, now seen corresponding path program 1 times [2024-11-10 22:45:06,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:06,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404218232] [2024-11-10 22:45:06,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:06,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:06,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:06,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:06,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:06,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1321692, now seen corresponding path program 4 times [2024-11-10 22:45:06,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:06,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797293839] [2024-11-10 22:45:06,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:06,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:06,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:06,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:06,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:06,989 INFO L85 PathProgramCache]: Analyzing trace with hash 351392017, now seen corresponding path program 4 times [2024-11-10 22:45:06,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:06,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895159091] [2024-11-10 22:45:06,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:06,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:07,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:07,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:07,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:08,186 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:45:08,187 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:45:08,187 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:45:08,187 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:45:08,187 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:45:08,187 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:08,187 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:45:08,187 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:45:08,188 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration9_Lasso [2024-11-10 22:45:08,188 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:45:08,188 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:45:08,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:08,768 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:45:08,769 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:45:08,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:08,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:08,771 INFO L229 MonitoredProcess]: Starting monitored process 47 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-10 22:45:08,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-10 22:45:08,786 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-10 22:45:08,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:08,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:08,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:08,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:08,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:08,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:08,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:08,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:08,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:08,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:08,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:08,809 INFO L229 MonitoredProcess]: Starting monitored process 48 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-10 22:45:08,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-10 22:45:08,811 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-10 22:45:08,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:08,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:08,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:08,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:08,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:08,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:08,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:08,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:08,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-10 22:45:08,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:08,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:08,834 INFO L229 MonitoredProcess]: Starting monitored process 49 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-10 22:45:08,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-10 22:45:08,836 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-10 22:45:08,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:08,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:08,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:08,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:08,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:08,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:08,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:08,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:08,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-10 22:45:08,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:08,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:08,859 INFO L229 MonitoredProcess]: Starting monitored process 50 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-10 22:45:08,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-10 22:45:08,861 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-10 22:45:08,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:08,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:08,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:08,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:08,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:08,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:08,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:08,872 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:08,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:08,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:08,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:08,883 INFO L229 MonitoredProcess]: Starting monitored process 51 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-10 22:45:08,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-10 22:45:08,885 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-10 22:45:08,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:08,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:08,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:08,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:08,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:08,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:08,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:08,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:08,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:08,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:08,911 INFO L229 MonitoredProcess]: Starting monitored process 52 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-10 22:45:08,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-10 22:45:08,912 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-10 22:45:08,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:08,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:08,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:08,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:08,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:08,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:08,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:08,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-10 22:45:08,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:08,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:08,976 INFO L229 MonitoredProcess]: Starting monitored process 53 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-10 22:45:08,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-10 22:45:08,979 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-10 22:45:08,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:08,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:08,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:08,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:08,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:08,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:08,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:09,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:09,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:09,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:09,013 INFO L229 MonitoredProcess]: Starting monitored process 54 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-10 22:45:09,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-10 22:45:09,015 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-10 22:45:09,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:09,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:09,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:09,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:09,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:09,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:09,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:09,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:09,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:09,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:09,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:09,039 INFO L229 MonitoredProcess]: Starting monitored process 55 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-10 22:45:09,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-10 22:45:09,040 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-10 22:45:09,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:09,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:09,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:09,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:09,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:09,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:09,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:45:09,072 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-10 22:45:09,072 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-10 22:45:09,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:09,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:09,073 INFO L229 MonitoredProcess]: Starting monitored process 56 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-10 22:45:09,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-10 22:45:09,074 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:45:09,085 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:45:09,085 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:45:09,085 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_5, ULTIMATE.start_cstrspn_~p~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_5 - 1*ULTIMATE.start_cstrspn_~p~0#1.offset Supporting invariants [] [2024-11-10 22:45:09,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-10 22:45:09,118 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2024-11-10 22:45:09,120 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-10 22:45:09,120 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-10 22:45:09,120 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~0!offset [2024-11-10 22:45:09,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:09,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 22:45:09,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:09,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 22:45:09,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:09,286 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-10 22:45:09,286 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-10 22:45:09,286 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 7 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-10 22:45:09,310 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 7. 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 30 states and 36 transitions. Complement of second has 5 states. [2024-11-10 22:45:09,312 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-10 22:45:09,312 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-10 22:45:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2024-11-10 22:45:09,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 17 letters. Loop has 4 letters. [2024-11-10 22:45:09,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:09,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 21 letters. Loop has 4 letters. [2024-11-10 22:45:09,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:09,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 17 letters. Loop has 8 letters. [2024-11-10 22:45:09,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:09,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2024-11-10 22:45:09,314 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 22:45:09,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2024-11-10 22:45:09,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-10 22:45:09,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-10 22:45:09,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-10 22:45:09,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:09,314 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 22:45:09,314 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 22:45:09,314 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 22:45:09,314 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-10 22:45:09,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-10 22:45:09,314 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 22:45:09,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-10 22:45:09,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:45:09 BoogieIcfgContainer [2024-11-10 22:45:09,322 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 22:45:09,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 22:45:09,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 22:45:09,323 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 22:45:09,323 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:44:55" (3/4) ... [2024-11-10 22:45:09,325 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 22:45:09,326 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 22:45:09,326 INFO L158 Benchmark]: Toolchain (without parser) took 14988.91ms. Allocated memory was 159.4MB in the beginning and 262.1MB in the end (delta: 102.8MB). Free memory was 103.0MB in the beginning and 171.8MB in the end (delta: -68.8MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2024-11-10 22:45:09,327 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:45:09,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.12ms. Allocated memory is still 159.4MB. Free memory was 102.6MB in the beginning and 120.1MB in the end (delta: -17.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 22:45:09,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.01ms. Allocated memory is still 159.4MB. Free memory was 120.1MB in the beginning and 118.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:45:09,327 INFO L158 Benchmark]: Boogie Preprocessor took 56.31ms. Allocated memory is still 159.4MB. Free memory was 118.0MB in the beginning and 115.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:45:09,328 INFO L158 Benchmark]: IcfgBuilder took 413.90ms. Allocated memory is still 159.4MB. Free memory was 115.9MB in the beginning and 101.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 22:45:09,328 INFO L158 Benchmark]: BuchiAutomizer took 13995.98ms. Allocated memory was 159.4MB in the beginning and 262.1MB in the end (delta: 102.8MB). Free memory was 101.9MB in the beginning and 171.8MB in the end (delta: -69.9MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2024-11-10 22:45:09,328 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 262.1MB. Free memory is still 171.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:45:09,329 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.12ms. Allocated memory is still 159.4MB. Free memory was 102.6MB in the beginning and 120.1MB in the end (delta: -17.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.01ms. Allocated memory is still 159.4MB. Free memory was 120.1MB in the beginning and 118.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.31ms. Allocated memory is still 159.4MB. Free memory was 118.0MB in the beginning and 115.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 413.90ms. Allocated memory is still 159.4MB. Free memory was 115.9MB in the beginning and 101.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 13995.98ms. Allocated memory was 159.4MB in the beginning and 262.1MB in the end (delta: 102.8MB). Free memory was 101.9MB in the beginning and 171.8MB in the end (delta: -69.9MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 262.1MB. Free memory is still 171.8MB. 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: ~spanp~0!offset - 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: ~spanp~0!offset - 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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (4 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (length1 + ((long long) -1 * i)) and consists of 3 locations. One deterministic module has affine ranking function (length2 + ((long long) -1 * i)) and consists of 3 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.9s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 12.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 7 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 [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 523 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 336 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 187 mSDtfsCounter, 247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital162 mio100 ax111 hnf100 lsp87 ukn76 mio100 lsp35 div134 bol100 ite100 ukn100 eq171 hnf91 smp88 dnf122 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 129ms VariablesStem: 6 VariablesLoop: 6 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 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-10 22:45:09,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-10 22:45:09,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:09,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE