./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/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/cstrspn-alloca-1.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.graphml --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 646417a8dd8807492175439f0c109786ec3887ae .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 06:02:17,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 06:02:17,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 06:02:17,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 06:02:17,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 06:02:17,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 06:02:17,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 06:02:17,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 06:02:17,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 06:02:17,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 06:02:17,567 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 06:02:17,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 06:02:17,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 06:02:17,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 06:02:17,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 06:02:17,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 06:02:17,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 06:02:17,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 06:02:17,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 06:02:17,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 06:02:17,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 06:02:17,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 06:02:17,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 06:02:17,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 06:02:17,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 06:02:17,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 06:02:17,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 06:02:17,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 06:02:17,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 06:02:17,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 06:02:17,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 06:02:17,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 06:02:17,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 06:02:17,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 06:02:17,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 06:02:17,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 06:02:17,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 06:02:17,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 06:02:17,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 06:02:17,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 06:02:17,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 06:02:17,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 06:02:17,694 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 06:02:17,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 06:02:17,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 06:02:17,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 06:02:17,700 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 06:02:17,700 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 06:02:17,701 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 06:02:17,701 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 06:02:17,701 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 06:02:17,701 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 06:02:17,703 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 06:02:17,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 06:02:17,704 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 06:02:17,704 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 06:02:17,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 06:02:17,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 06:02:17,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 06:02:17,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 06:02:17,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 06:02:17,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 06:02:17,706 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 06:02:17,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 06:02:17,707 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 06:02:17,707 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 06:02:17,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 06:02:17,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 06:02:17,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 06:02:17,708 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 06:02:17,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 06:02:17,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 06:02:17,709 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 06:02:17,709 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 06:02:17,711 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 06:02:17,712 INFO L138 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.graphml 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 -> 646417a8dd8807492175439f0c109786ec3887ae [2020-10-26 06:02:18,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 06:02:18,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 06:02:18,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 06:02:18,181 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 06:02:18,182 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 06:02:18,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2020-10-26 06:02:18,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2fd93fe5/3e65576751a54942a3398cbabd03f1cc/FLAGdb1dd06ad [2020-10-26 06:02:19,069 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 06:02:19,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2020-10-26 06:02:19,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2fd93fe5/3e65576751a54942a3398cbabd03f1cc/FLAGdb1dd06ad [2020-10-26 06:02:19,329 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2fd93fe5/3e65576751a54942a3398cbabd03f1cc [2020-10-26 06:02:19,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 06:02:19,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 06:02:19,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 06:02:19,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 06:02:19,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 06:02:19,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:02:19" (1/1) ... [2020-10-26 06:02:19,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c3bb57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:19, skipping insertion in model container [2020-10-26 06:02:19,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:02:19" (1/1) ... [2020-10-26 06:02:19,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 06:02:19,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 06:02:19,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 06:02:19,873 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 06:02:19,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 06:02:19,990 INFO L208 MainTranslator]: Completed translation [2020-10-26 06:02:19,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:19 WrapperNode [2020-10-26 06:02:19,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 06:02:19,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 06:02:19,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 06:02:19,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 06:02:20,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:19" (1/1) ... [2020-10-26 06:02:20,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:19" (1/1) ... [2020-10-26 06:02:20,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 06:02:20,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 06:02:20,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 06:02:20,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 06:02:20,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:19" (1/1) ... [2020-10-26 06:02:20,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:19" (1/1) ... [2020-10-26 06:02:20,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:19" (1/1) ... [2020-10-26 06:02:20,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:19" (1/1) ... [2020-10-26 06:02:20,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:19" (1/1) ... [2020-10-26 06:02:20,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:19" (1/1) ... [2020-10-26 06:02:20,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:19" (1/1) ... [2020-10-26 06:02:20,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 06:02:20,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 06:02:20,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 06:02:20,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 06:02:20,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:20,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 06:02:20,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 06:02:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 06:02:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 06:02:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 06:02:20,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 06:02:20,668 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 06:02:20,669 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-26 06:02:20,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:02:20 BoogieIcfgContainer [2020-10-26 06:02:20,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 06:02:20,672 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 06:02:20,672 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 06:02:20,676 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 06:02:20,677 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:02:20,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 06:02:19" (1/3) ... [2020-10-26 06:02:20,678 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b07a44b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 06:02:20, skipping insertion in model container [2020-10-26 06:02:20,679 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:02:20,679 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:02:19" (2/3) ... [2020-10-26 06:02:20,679 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b07a44b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 06:02:20, skipping insertion in model container [2020-10-26 06:02:20,680 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 06:02:20,680 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:02:20" (3/3) ... [2020-10-26 06:02:20,682 INFO L373 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca-1.i [2020-10-26 06:02:20,735 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 06:02:20,736 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 06:02:20,736 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 06:02:20,736 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 06:02:20,736 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 06:02:20,737 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 06:02:20,737 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 06:02:20,737 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 06:02:20,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-26 06:02:20,782 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-10-26 06:02:20,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:20,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:20,791 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 06:02:20,791 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:02:20,792 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 06:02:20,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-26 06:02:20,795 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-10-26 06:02:20,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:20,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:20,796 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 06:02:20,796 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:02:20,805 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 13#L532true assume !(main_~length1~0 < 1); 18#L532-2true assume !(main_~length2~0 < 1); 9#L535-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 25#L541-3true [2020-10-26 06:02:20,806 INFO L796 eck$LassoCheckResult]: Loop: 25#L541-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 22#L541-2true main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 25#L541-3true [2020-10-26 06:02:20,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:20,814 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-10-26 06:02:20,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:20,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047690422] [2020-10-26 06:02:20,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:20,949 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:20,967 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:20,992 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:20,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:20,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-10-26 06:02:20,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:20,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788746985] [2020-10-26 06:02:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:21,009 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:21,018 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:21,022 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:21,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:21,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-10-26 06:02:21,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:21,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120850111] [2020-10-26 06:02:21,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:21,083 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:21,134 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:21,150 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:21,480 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-10-26 06:02:21,603 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:02:21,604 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:02:21,604 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:02:21,604 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:02:21,605 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:02:21,605 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:21,605 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:02:21,605 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:02:21,605 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration1_Lasso [2020-10-26 06:02:21,606 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:02:21,606 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:02:21,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:21,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:21,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:21,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:21,810 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-10-26 06:02:21,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:21,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:21,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:21,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:21,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:21,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:21,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:21,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:21,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:21,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:21,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:22,272 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:02:22,278 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:22,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:22,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:22,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:22,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:22,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:22,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:22,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:22,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:22,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:22,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:22,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:22,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:22,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:22,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:22,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:22,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:22,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:22,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:22,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:22,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:22,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:22,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:22,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:22,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:22,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:22,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:22,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:22,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:22,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:22,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:22,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:22,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:22,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:22,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:22,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:22,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:22,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:22,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:22,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:22,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:22,509 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:22,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:22,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:22,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:22,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:22,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:22,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:22,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:22,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:22,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:22,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:22,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:22,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:22,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:22,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:22,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:22,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:22,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:22,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:22,630 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:02:22,713 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-10-26 06:02:22,713 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:22,722 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:22,725 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:02:22,726 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:02:22,727 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-26 06:02:22,793 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-10-26 06:02:22,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:22,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 06:02:22,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:22,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 06:02:22,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:02:23,092 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 06:02:23,093 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2020-10-26 06:02:23,185 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 60 states and 87 transitions. Complement of second has 7 states. [2020-10-26 06:02:23,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 06:02:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 06:02:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2020-10-26 06:02:23,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-26 06:02:23,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:23,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 2 letters. [2020-10-26 06:02:23,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:23,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2020-10-26 06:02:23,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:23,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2020-10-26 06:02:23,209 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 06:02:23,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 27 transitions. [2020-10-26 06:02:23,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-26 06:02:23,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-26 06:02:23,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2020-10-26 06:02:23,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:02:23,219 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-10-26 06:02:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2020-10-26 06:02:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-26 06:02:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-26 06:02:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2020-10-26 06:02:23,250 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-10-26 06:02:23,250 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-10-26 06:02:23,250 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 06:02:23,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2020-10-26 06:02:23,253 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 06:02:23,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:23,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:23,254 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:23,254 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 06:02:23,254 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 167#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 168#L532 assume !(main_~length1~0 < 1); 169#L532-2 assume !(main_~length2~0 < 1); 163#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 164#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 160#L541-4 main_~i~1 := 0; 161#L546-3 [2020-10-26 06:02:23,254 INFO L796 eck$LassoCheckResult]: Loop: 161#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 165#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 161#L546-3 [2020-10-26 06:02:23,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:23,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2020-10-26 06:02:23,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:23,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50530041] [2020-10-26 06:02:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:23,288 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:23,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:23,313 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:23,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:23,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2020-10-26 06:02:23,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:23,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737182603] [2020-10-26 06:02:23,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:23,330 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:23,341 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:23,344 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:23,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:23,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2020-10-26 06:02:23,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:23,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440780941] [2020-10-26 06:02:23,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:23,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:23,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:23,411 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:23,660 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-10-26 06:02:23,749 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:02:23,749 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:02:23,749 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:02:23,749 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:02:23,749 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:02:23,749 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:23,750 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:02:23,750 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:02:23,750 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration2_Lasso [2020-10-26 06:02:23,750 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:02:23,750 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:02:23,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:23,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:23,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:23,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:23,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:23,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:23,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:23,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:23,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:23,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:23,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:23,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:23,946 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2020-10-26 06:02:23,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:23,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:24,382 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:02:24,382 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:24,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:24,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:24,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:24,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:24,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:24,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:24,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:24,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:24,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:24,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:24,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:24,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:24,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:24,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:24,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:24,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:24,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:24,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:24,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:24,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:24,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:24,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:24,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:24,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:24,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:24,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:24,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:24,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:24,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:24,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:24,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:24,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:24,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:24,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:24,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:24,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:24,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:24,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:24,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:24,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:24,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:24,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:24,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:24,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:24,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:24,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:24,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:24,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:24,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:24,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:24,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:24,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:24,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:24,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:24,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:24,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:24,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:24,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:24,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:24,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:24,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:24,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:24,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:24,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:24,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:24,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:24,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:24,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:24,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:24,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:24,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:24,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:24,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:24,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:24,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:24,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:24,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:24,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:24,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:24,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:24,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:24,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:24,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:24,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:24,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:24,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:24,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:24,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:24,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:24,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:24,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:24,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:24,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:24,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:24,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:24,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:24,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:24,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:24,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:24,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:24,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:24,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:24,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:24,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:24,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:24,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:24,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:24,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:24,955 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:02:25,026 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2020-10-26 06:02:25,026 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:25,029 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:25,033 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-26 06:02:25,033 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:02:25,034 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_main_~i~1 Supporting invariants [1*ULTIMATE.start_main_~nondetString2~0.offset >= 0] [2020-10-26 06:02:25,086 INFO L297 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2020-10-26 06:02:25,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 06:02:25,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:25,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 06:02:25,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:25,208 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 06:02:25,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:25,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:02:25,232 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-26 06:02:25,233 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 4 states. [2020-10-26 06:02:25,315 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 31 states and 44 transitions. Complement of second has 7 states. [2020-10-26 06:02:25,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 06:02:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-26 06:02:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-10-26 06:02:25,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2020-10-26 06:02:25,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:25,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2020-10-26 06:02:25,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:25,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2020-10-26 06:02:25,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:25,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2020-10-26 06:02:25,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 06:02:25,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2020-10-26 06:02:25,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-26 06:02:25,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-26 06:02:25,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2020-10-26 06:02:25,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:02:25,321 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-10-26 06:02:25,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2020-10-26 06:02:25,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-26 06:02:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-26 06:02:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-10-26 06:02:25,324 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-10-26 06:02:25,324 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-10-26 06:02:25,324 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 06:02:25,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2020-10-26 06:02:25,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 06:02:25,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:25,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:25,325 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:25,326 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:25,326 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 304#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 305#L532 assume !(main_~length1~0 < 1); 306#L532-2 assume !(main_~length2~0 < 1); 299#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 300#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 296#L541-4 main_~i~1 := 0; 297#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 303#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 293#L519-4 [2020-10-26 06:02:25,326 INFO L796 eck$LassoCheckResult]: Loop: 293#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 298#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 310#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 307#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 308#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 294#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 295#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 292#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 293#L519-4 [2020-10-26 06:02:25,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:25,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2020-10-26 06:02:25,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:25,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757984567] [2020-10-26 06:02:25,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:25,349 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:25,379 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:25,392 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:25,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:25,393 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2020-10-26 06:02:25,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:25,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528608768] [2020-10-26 06:02:25,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:25,420 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:25,442 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:25,449 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:25,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:25,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2020-10-26 06:02:25,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:25,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673655745] [2020-10-26 06:02:25,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:02:25,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673655745] [2020-10-26 06:02:25,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:02:25,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 06:02:25,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618644523] [2020-10-26 06:02:25,930 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-10-26 06:02:26,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:26,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-26 06:02:26,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-26 06:02:26,024 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand 10 states. [2020-10-26 06:02:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:26,464 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2020-10-26 06:02:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-26 06:02:26,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2020-10-26 06:02:26,467 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-10-26 06:02:26,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 64 transitions. [2020-10-26 06:02:26,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-10-26 06:02:26,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-10-26 06:02:26,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2020-10-26 06:02:26,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:02:26,473 INFO L691 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2020-10-26 06:02:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2020-10-26 06:02:26,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2020-10-26 06:02:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-26 06:02:26,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2020-10-26 06:02:26,480 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-10-26 06:02:26,480 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-10-26 06:02:26,480 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 06:02:26,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2020-10-26 06:02:26,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-26 06:02:26,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:26,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:26,482 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:26,482 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:02:26,483 INFO L794 eck$LassoCheckResult]: Stem: 413#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 407#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 408#L532 assume !(main_~length1~0 < 1); 409#L532-2 assume !(main_~length2~0 < 1); 401#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 402#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 419#L541-4 main_~i~1 := 0; 405#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 406#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 423#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 422#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 415#L522-5 [2020-10-26 06:02:26,483 INFO L796 eck$LassoCheckResult]: Loop: 415#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 420#L522-1 assume !cstrspn_#t~short7; 421#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 415#L522-5 [2020-10-26 06:02:26,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:26,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759941, now seen corresponding path program 1 times [2020-10-26 06:02:26,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:26,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200009033] [2020-10-26 06:02:26,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:02:26,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200009033] [2020-10-26 06:02:26,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:02:26,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 06:02:26,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990939895] [2020-10-26 06:02:26,642 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:02:26,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:26,642 INFO L82 PathProgramCache]: Analyzing trace with hash 86558, now seen corresponding path program 1 times [2020-10-26 06:02:26,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:26,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872867114] [2020-10-26 06:02:26,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:02:26,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872867114] [2020-10-26 06:02:26,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:02:26,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 06:02:26,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158521184] [2020-10-26 06:02:26,663 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 06:02:26,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:26,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 06:02:26,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 06:02:26,665 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand 3 states. [2020-10-26 06:02:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:26,681 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2020-10-26 06:02:26,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 06:02:26,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 44 transitions. [2020-10-26 06:02:26,686 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-26 06:02:26,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 44 transitions. [2020-10-26 06:02:26,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-10-26 06:02:26,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-10-26 06:02:26,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2020-10-26 06:02:26,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:02:26,687 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-10-26 06:02:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2020-10-26 06:02:26,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-10-26 06:02:26,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-26 06:02:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-10-26 06:02:26,695 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-10-26 06:02:26,696 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-10-26 06:02:26,696 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 06:02:26,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2020-10-26 06:02:26,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-26 06:02:26,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:26,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:26,699 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:26,700 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:02:26,700 INFO L794 eck$LassoCheckResult]: Stem: 489#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 483#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 484#L532 assume !(main_~length1~0 < 1); 485#L532-2 assume !(main_~length2~0 < 1); 478#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 479#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 493#L541-4 main_~i~1 := 0; 501#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 498#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 476#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 477#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 490#L522-5 [2020-10-26 06:02:26,701 INFO L796 eck$LassoCheckResult]: Loop: 490#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 486#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 487#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 490#L522-5 [2020-10-26 06:02:26,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:26,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759941, now seen corresponding path program 2 times [2020-10-26 06:02:26,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:26,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565403373] [2020-10-26 06:02:26,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:02:26,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565403373] [2020-10-26 06:02:26,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:02:26,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 06:02:26,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302394089] [2020-10-26 06:02:26,872 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:02:26,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:26,873 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2020-10-26 06:02:26,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:26,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120455094] [2020-10-26 06:02:26,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:26,879 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:26,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:26,886 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:27,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:27,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 06:02:27,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 06:02:27,025 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 16 Second operand 7 states. [2020-10-26 06:02:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:27,140 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-10-26 06:02:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 06:02:27,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2020-10-26 06:02:27,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-10-26 06:02:27,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 23 states and 30 transitions. [2020-10-26 06:02:27,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-26 06:02:27,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-26 06:02:27,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2020-10-26 06:02:27,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:02:27,144 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-10-26 06:02:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2020-10-26 06:02:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-26 06:02:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-26 06:02:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2020-10-26 06:02:27,146 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-10-26 06:02:27,146 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-10-26 06:02:27,146 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 06:02:27,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2020-10-26 06:02:27,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-10-26 06:02:27,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:27,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:27,148 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:27,148 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:27,148 INFO L794 eck$LassoCheckResult]: Stem: 564#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 558#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 559#L532 assume !(main_~length1~0 < 1); 560#L532-2 assume !(main_~length2~0 < 1); 553#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 554#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 566#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 567#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 550#L541-4 main_~i~1 := 0; 551#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 557#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 547#L519-4 [2020-10-26 06:02:27,148 INFO L796 eck$LassoCheckResult]: Loop: 547#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 552#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 565#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 561#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 562#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 548#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 549#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 546#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 547#L519-4 [2020-10-26 06:02:27,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:27,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2020-10-26 06:02:27,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:27,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994452542] [2020-10-26 06:02:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:27,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:27,174 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:27,179 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:27,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:27,180 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 2 times [2020-10-26 06:02:27,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:27,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968322782] [2020-10-26 06:02:27,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:27,187 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:27,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:27,196 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:27,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:27,197 INFO L82 PathProgramCache]: Analyzing trace with hash -164170776, now seen corresponding path program 1 times [2020-10-26 06:02:27,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:27,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678410054] [2020-10-26 06:02:27,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 06:02:27,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678410054] [2020-10-26 06:02:27,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:02:27,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 06:02:27,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110030451] [2020-10-26 06:02:27,664 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-10-26 06:02:27,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:27,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-26 06:02:27,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-26 06:02:27,742 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 10 Second operand 10 states. [2020-10-26 06:02:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:28,059 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-10-26 06:02:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 06:02:28,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2020-10-26 06:02:28,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2020-10-26 06:02:28,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 36 states and 45 transitions. [2020-10-26 06:02:28,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-10-26 06:02:28,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-10-26 06:02:28,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2020-10-26 06:02:28,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:02:28,064 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2020-10-26 06:02:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2020-10-26 06:02:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-10-26 06:02:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-26 06:02:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2020-10-26 06:02:28,068 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-10-26 06:02:28,068 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-10-26 06:02:28,068 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 06:02:28,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2020-10-26 06:02:28,069 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2020-10-26 06:02:28,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:28,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:28,069 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:28,070 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:28,070 INFO L794 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 647#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 648#L532 assume !(main_~length1~0 < 1); 649#L532-2 assume !(main_~length2~0 < 1); 641#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 642#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 658#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 659#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 636#L541-4 main_~i~1 := 0; 637#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 645#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 635#L519-4 [2020-10-26 06:02:28,070 INFO L796 eck$LassoCheckResult]: Loop: 635#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 638#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 662#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 661#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 654#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 655#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 666#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 664#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 632#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 633#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 634#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 635#L519-4 [2020-10-26 06:02:28,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:28,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 2 times [2020-10-26 06:02:28,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:28,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263150096] [2020-10-26 06:02:28,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:28,082 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:28,091 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:28,096 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:28,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:28,097 INFO L82 PathProgramCache]: Analyzing trace with hash -898285594, now seen corresponding path program 1 times [2020-10-26 06:02:28,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:28,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913349862] [2020-10-26 06:02:28,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:28,106 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:28,113 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:28,116 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:28,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:28,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1809250353, now seen corresponding path program 1 times [2020-10-26 06:02:28,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:28,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711712113] [2020-10-26 06:02:28,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 06:02:28,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711712113] [2020-10-26 06:02:28,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499266411] [2020-10-26 06:02:28,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:02:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:28,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-26 06:02:28,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:28,336 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:02:28,336 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-10-26 06:02:28,337 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 06:02:28,354 INFO L625 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2020-10-26 06:02:28,358 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 06:02:28,359 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:5 [2020-10-26 06:02:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 06:02:28,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-26 06:02:28,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2020-10-26 06:02:28,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076788065] [2020-10-26 06:02:28,829 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2020-10-26 06:02:28,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:28,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-26 06:02:28,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-26 06:02:28,942 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. cyclomatic complexity: 13 Second operand 9 states. [2020-10-26 06:02:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:29,168 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-10-26 06:02:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 06:02:29,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2020-10-26 06:02:29,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-10-26 06:02:29,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 23 states and 29 transitions. [2020-10-26 06:02:29,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-26 06:02:29,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-26 06:02:29,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2020-10-26 06:02:29,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:02:29,171 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-10-26 06:02:29,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2020-10-26 06:02:29,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-26 06:02:29,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-26 06:02:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2020-10-26 06:02:29,173 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-10-26 06:02:29,173 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-10-26 06:02:29,173 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 06:02:29,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2020-10-26 06:02:29,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-10-26 06:02:29,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:29,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:29,175 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:29,175 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:29,175 INFO L794 eck$LassoCheckResult]: Stem: 808#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 802#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 803#L532 assume !(main_~length1~0 < 1); 804#L532-2 assume !(main_~length2~0 < 1); 797#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 798#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 810#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 811#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 794#L541-4 main_~i~1 := 0; 795#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 799#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 800#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 801#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 793#L519-4 [2020-10-26 06:02:29,175 INFO L796 eck$LassoCheckResult]: Loop: 793#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 796#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 809#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 805#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 806#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 790#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 791#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 792#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 793#L519-4 [2020-10-26 06:02:29,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:29,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2020-10-26 06:02:29,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:29,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550449440] [2020-10-26 06:02:29,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:29,187 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:29,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:29,203 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:29,204 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 3 times [2020-10-26 06:02:29,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:29,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260992225] [2020-10-26 06:02:29,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:29,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:29,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:29,218 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:29,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:29,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1875279350, now seen corresponding path program 1 times [2020-10-26 06:02:29,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:29,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719035715] [2020-10-26 06:02:29,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:29,235 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:29,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:29,257 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:29,452 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-10-26 06:02:30,272 WARN L193 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 115 [2020-10-26 06:02:30,554 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-26 06:02:30,557 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:02:30,557 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:02:30,557 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:02:30,557 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:02:30,557 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:02:30,557 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:30,557 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:02:30,557 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:02:30,557 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration8_Lasso [2020-10-26 06:02:30,557 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:02:30,558 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:02:30,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:30,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:31,301 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2020-10-26 06:02:31,596 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2020-10-26 06:02:31,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:32,035 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-10-26 06:02:32,490 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-10-26 06:02:32,749 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2020-10-26 06:02:32,798 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:02:32,799 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:32,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:32,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:32,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:32,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:32,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:32,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:32,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:32,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:32,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:32,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:32,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:32,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:32,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:32,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:32,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:32,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:32,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:32,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:32,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:32,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:32,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:32,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:32,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:32,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:32,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:32,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:32,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:32,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:32,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:32,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:32,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:32,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:32,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:32,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:32,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:32,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:32,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:32,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:32,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:32,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:32,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:32,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:32,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:32,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:32,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:32,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:32,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:32,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:32,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:32,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:32,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:32,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:32,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:32,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:32,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:32,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:32,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:32,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:32,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:32,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:32,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:33,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:33,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:33,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:33,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:33,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:33,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:33,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:33,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:33,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:33,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:33,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:33,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:33,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:33,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:33,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:33,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:33,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:33,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:33,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:33,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:33,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:33,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:33,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:33,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:33,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:33,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:33,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:33,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:33,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:33,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:33,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:33,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:33,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:33,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:33,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:33,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:33,398 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:33,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:33,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:33,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:33,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:33,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:33,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:33,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:33,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:33,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:33,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:33,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:33,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:33,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:33,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:33,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:33,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:33,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:33,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:33,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:33,666 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:02:33,725 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2020-10-26 06:02:33,725 INFO L444 ModelExtractionUtils]: 39 out of 61 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:33,728 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 06:02:33,731 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:02:33,731 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:02:33,731 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_3) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_3 Supporting invariants [] [2020-10-26 06:02:33,830 INFO L297 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2020-10-26 06:02:33,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 06:02:33,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:33,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 06:02:33,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:33,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 06:02:33,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:02:33,971 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-26 06:02:33,971 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-26 06:02:34,046 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 31 states and 40 transitions. Complement of second has 5 states. [2020-10-26 06:02:34,046 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 [2020-10-26 06:02:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-26 06:02:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2020-10-26 06:02:34,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 8 letters. [2020-10-26 06:02:34,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:34,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 8 letters. [2020-10-26 06:02:34,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:34,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 16 letters. [2020-10-26 06:02:34,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:34,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2020-10-26 06:02:34,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 06:02:34,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 35 transitions. [2020-10-26 06:02:34,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-26 06:02:34,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-26 06:02:34,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2020-10-26 06:02:34,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:34,052 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-10-26 06:02:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2020-10-26 06:02:34,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-10-26 06:02:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-26 06:02:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2020-10-26 06:02:34,058 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-10-26 06:02:34,058 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-10-26 06:02:34,058 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-26 06:02:34,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2020-10-26 06:02:34,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 06:02:34,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:34,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:34,061 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:34,062 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:02:34,062 INFO L794 eck$LassoCheckResult]: Stem: 1024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1016#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1017#L532 assume !(main_~length1~0 < 1); 1018#L532-2 assume !(main_~length2~0 < 1); 1011#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1012#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1027#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1028#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1006#L541-4 main_~i~1 := 0; 1007#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1013#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1014#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1015#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 1008#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1010#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1025#L522-5 [2020-10-26 06:02:34,062 INFO L796 eck$LassoCheckResult]: Loop: 1025#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1019#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1020#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 1025#L522-5 [2020-10-26 06:02:34,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:34,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2020-10-26 06:02:34,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:34,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578659279] [2020-10-26 06:02:34,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:34,077 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:34,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:34,093 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:34,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:34,094 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 2 times [2020-10-26 06:02:34,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:34,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296824652] [2020-10-26 06:02:34,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:34,100 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:34,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:34,105 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:34,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:34,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2020-10-26 06:02:34,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:34,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940128127] [2020-10-26 06:02:34,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:34,128 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:34,146 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:34,151 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:35,320 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 156 DAG size of output: 129 [2020-10-26 06:02:35,653 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-26 06:02:35,655 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:02:35,655 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:02:35,656 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:02:35,656 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:02:35,656 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:02:35,656 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:35,656 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:02:35,656 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:02:35,656 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration9_Lasso [2020-10-26 06:02:35,656 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:02:35,657 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:02:35,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:35,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:35,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:35,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:35,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:35,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,425 WARN L193 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2020-10-26 06:02:36,677 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2020-10-26 06:02:36,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:36,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:37,060 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2020-10-26 06:02:37,563 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-10-26 06:02:38,109 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-10-26 06:02:38,285 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:02:38,285 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:38,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:38,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:38,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:38,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:38,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:38,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:38,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:38,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:38,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:38,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:38,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:38,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:38,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:38,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:38,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:38,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:38,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:38,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:38,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:38,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:38,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:38,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:38,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:38,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:38,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:38,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:38,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:38,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:38,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:38,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:38,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:38,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:38,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:38,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:38,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:38,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:38,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:38,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:38,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:38,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:38,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:38,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:38,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:38,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:38,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:38,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:38,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:38,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:38,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:38,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:38,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:38,503 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:02:38,550 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2020-10-26 06:02:38,550 INFO L444 ModelExtractionUtils]: 22 out of 58 variables were initially zero. Simplification set additionally 33 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:38,553 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 06:02:38,555 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:02:38,555 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:02:38,555 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_2) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_2 Supporting invariants [] [2020-10-26 06:02:38,692 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2020-10-26 06:02:38,695 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 06:02:38,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:38,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 06:02:38,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:38,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 06:02:38,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:02:38,811 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-26 06:02:38,811 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-10-26 06:02:38,874 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 54 states and 67 transitions. Complement of second has 6 states. [2020-10-26 06:02:38,876 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 [2020-10-26 06:02:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-26 06:02:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2020-10-26 06:02:38,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-26 06:02:38,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:38,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 18 letters. Loop has 3 letters. [2020-10-26 06:02:38,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:38,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 15 letters. Loop has 6 letters. [2020-10-26 06:02:38,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:38,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 67 transitions. [2020-10-26 06:02:38,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 06:02:38,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 40 states and 50 transitions. [2020-10-26 06:02:38,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-26 06:02:38,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-26 06:02:38,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 50 transitions. [2020-10-26 06:02:38,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:38,881 INFO L691 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2020-10-26 06:02:38,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 50 transitions. [2020-10-26 06:02:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2020-10-26 06:02:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-26 06:02:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2020-10-26 06:02:38,884 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2020-10-26 06:02:38,884 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2020-10-26 06:02:38,884 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-26 06:02:38,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2020-10-26 06:02:38,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 06:02:38,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:38,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:38,886 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:38,886 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:02:38,886 INFO L794 eck$LassoCheckResult]: Stem: 1292#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1285#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1286#L532 assume !(main_~length1~0 < 1); 1287#L532-2 assume !(main_~length2~0 < 1); 1280#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1281#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1295#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1296#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1274#L541-4 main_~i~1 := 0; 1275#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1282#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1283#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1284#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 1276#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1277#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1294#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1290#L522-1 assume !cstrspn_#t~short7; 1291#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 1270#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 1271#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 1272#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 1273#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1279#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1293#L522-5 [2020-10-26 06:02:38,886 INFO L796 eck$LassoCheckResult]: Loop: 1293#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1288#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1289#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 1293#L522-5 [2020-10-26 06:02:38,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:38,887 INFO L82 PathProgramCache]: Analyzing trace with hash -777149455, now seen corresponding path program 1 times [2020-10-26 06:02:38,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:38,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450661094] [2020-10-26 06:02:38,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-26 06:02:38,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450661094] [2020-10-26 06:02:38,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 06:02:38,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-26 06:02:38,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864067162] [2020-10-26 06:02:38,974 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:02:38,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:38,975 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 3 times [2020-10-26 06:02:38,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:38,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784425485] [2020-10-26 06:02:38,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:38,980 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:38,983 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:38,987 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:39,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:39,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 06:02:39,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-26 06:02:39,111 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand 7 states. [2020-10-26 06:02:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:39,252 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2020-10-26 06:02:39,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 06:02:39,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2020-10-26 06:02:39,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 06:02:39,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 39 transitions. [2020-10-26 06:02:39,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-26 06:02:39,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-26 06:02:39,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2020-10-26 06:02:39,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:39,255 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-10-26 06:02:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2020-10-26 06:02:39,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-26 06:02:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-26 06:02:39,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-10-26 06:02:39,257 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-10-26 06:02:39,258 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-10-26 06:02:39,258 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-26 06:02:39,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2020-10-26 06:02:39,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 06:02:39,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:39,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:39,259 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:39,259 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:02:39,259 INFO L794 eck$LassoCheckResult]: Stem: 1377#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1370#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1371#L532 assume !(main_~length1~0 < 1); 1372#L532-2 assume !(main_~length2~0 < 1); 1365#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1366#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1382#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1383#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1359#L541-4 main_~i~1 := 0; 1360#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1367#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1368#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1369#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 1361#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1362#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1380#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1386#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1384#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 1355#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 1356#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 1357#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 1358#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1364#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1378#L522-5 [2020-10-26 06:02:39,259 INFO L796 eck$LassoCheckResult]: Loop: 1378#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1373#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1374#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 1378#L522-5 [2020-10-26 06:02:39,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:39,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1742810479, now seen corresponding path program 2 times [2020-10-26 06:02:39,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:39,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098287517] [2020-10-26 06:02:39,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 06:02:39,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098287517] [2020-10-26 06:02:39,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029256164] [2020-10-26 06:02:39,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 06:02:39,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 06:02:39,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 06:02:39,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2020-10-26 06:02:39,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:39,629 INFO L384 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2020-10-26 06:02:39,631 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 06:02:39,636 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:02:39,637 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 06:02:39,637 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2020-10-26 06:02:39,752 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2020-10-26 06:02:39,752 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 06:02:39,766 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:02:39,771 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-26 06:02:39,772 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:31 [2020-10-26 06:02:40,088 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:02:40,088 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2020-10-26 06:02:40,090 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-26 06:02:40,108 INFO L625 ElimStorePlain]: treesize reduction 8, result has 63.6 percent of original size [2020-10-26 06:02:40,120 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 06:02:40,121 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:38, output treesize:3 [2020-10-26 06:02:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 06:02:40,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 06:02:40,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-10-26 06:02:40,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872490345] [2020-10-26 06:02:40,129 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 06:02:40,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:40,129 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 4 times [2020-10-26 06:02:40,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:40,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350311672] [2020-10-26 06:02:40,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,146 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:40,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 06:02:40,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-26 06:02:40,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-10-26 06:02:40,287 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand 15 states. [2020-10-26 06:02:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 06:02:40,831 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2020-10-26 06:02:40,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 06:02:40,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 62 transitions. [2020-10-26 06:02:40,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 06:02:40,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 35 states and 42 transitions. [2020-10-26 06:02:40,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-26 06:02:40,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-26 06:02:40,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2020-10-26 06:02:40,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:02:40,834 INFO L691 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-26 06:02:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2020-10-26 06:02:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-10-26 06:02:40,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-26 06:02:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2020-10-26 06:02:40,837 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2020-10-26 06:02:40,837 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2020-10-26 06:02:40,837 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-26 06:02:40,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2020-10-26 06:02:40,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 06:02:40,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:02:40,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:02:40,838 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:02:40,838 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:02:40,839 INFO L794 eck$LassoCheckResult]: Stem: 1558#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1551#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1552#L532 assume !(main_~length1~0 < 1); 1553#L532-2 assume !(main_~length2~0 < 1); 1546#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1547#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1563#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1564#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1566#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1568#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1540#L541-4 main_~i~1 := 0; 1541#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1548#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1549#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1550#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 1542#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1543#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1561#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1556#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1557#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 1536#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 1537#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 1538#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 1539#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1545#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1559#L522-5 [2020-10-26 06:02:40,839 INFO L796 eck$LassoCheckResult]: Loop: 1559#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1554#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1555#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 1559#L522-5 [2020-10-26 06:02:40,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:40,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1365761455, now seen corresponding path program 3 times [2020-10-26 06:02:40,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:40,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108537556] [2020-10-26 06:02:40,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,862 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,891 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:40,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:40,892 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 5 times [2020-10-26 06:02:40,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:40,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976821803] [2020-10-26 06:02:40,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,897 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,900 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,901 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:40,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:40,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1174254192, now seen corresponding path program 1 times [2020-10-26 06:02:40,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:02:40,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986451097] [2020-10-26 06:02:40,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:02:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,923 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:02:40,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:02:40,951 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:02:43,182 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 228 DAG size of output: 177 [2020-10-26 06:02:50,985 WARN L193 SmtUtils]: Spent 7.78 s on a formula simplification. DAG size of input: 152 DAG size of output: 152 [2020-10-26 06:02:50,989 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:02:50,990 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:02:50,990 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:02:50,990 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:02:50,990 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:02:50,990 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:50,990 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:02:50,990 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:02:50,990 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration12_Lasso [2020-10-26 06:02:50,991 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:02:50,991 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:02:51,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:51,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:51,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:51,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:51,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:51,645 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-10-26 06:02:53,348 WARN L193 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 133 DAG size of output: 114 [2020-10-26 06:02:53,621 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2020-10-26 06:02:53,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:53,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:02:54,048 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-10-26 06:02:54,625 WARN L193 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2020-10-26 06:02:54,912 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2020-10-26 06:02:55,094 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-26 06:02:56,137 WARN L193 SmtUtils]: Spent 978.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2020-10-26 06:02:56,523 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-10-26 06:02:56,762 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:02:56,763 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:56,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:56,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:56,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:56,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:56,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:56,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:56,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:56,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:56,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:56,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:56,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:56,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:56,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:56,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:56,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:56,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:56,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:56,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:56,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:56,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:56,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:02:56,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:56,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:56,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:56,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:02:56,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:02:56,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:56,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:56,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:56,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:56,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:56,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:56,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:56,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:56,860 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:56,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:56,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:56,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:56,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:56,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:56,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:56,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:56,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:56,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:02:56,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:02:56,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:02:56,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:02:56,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:02:56,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:02:56,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:02:56,959 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:02:57,019 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2020-10-26 06:02:57,020 INFO L444 ModelExtractionUtils]: 26 out of 55 variables were initially zero. Simplification set additionally 24 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:02:57,022 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:02:57,025 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-26 06:02:57,026 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:02:57,026 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_5, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_5 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_5 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_3 >= 0] [2020-10-26 06:02:57,362 INFO L297 tatePredicateManager]: 33 out of 36 supporting invariants were superfluous and have been removed [2020-10-26 06:02:57,370 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 06:02:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:57,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-26 06:02:57,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:57,500 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:02:57,500 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-10-26 06:02:57,501 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 06:02:57,551 INFO L625 ElimStorePlain]: treesize reduction 10, result has 73.7 percent of original size [2020-10-26 06:02:57,551 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 06:02:57,551 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:28 [2020-10-26 06:02:57,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 06:02:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:57,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-26 06:02:57,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:57,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:02:57,980 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2020-10-26 06:02:57,980 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 10 states. [2020-10-26 06:02:58,800 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 10 states. Result 62 states and 73 transitions. Complement of second has 13 states. [2020-10-26 06:02:58,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 1 non-accepting loop states 2 accepting loop states [2020-10-26 06:02:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-26 06:02:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2020-10-26 06:02:58,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 36 transitions. Stem has 25 letters. Loop has 3 letters. [2020-10-26 06:02:58,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:02:58,803 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 06:02:58,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:02:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:58,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-26 06:02:58,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:58,940 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:02:58,940 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-10-26 06:02:58,940 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 06:02:58,990 INFO L625 ElimStorePlain]: treesize reduction 10, result has 73.7 percent of original size [2020-10-26 06:02:58,991 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 06:02:58,991 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:28 [2020-10-26 06:02:59,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 06:02:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:02:59,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-26 06:02:59,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:02:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:02:59,418 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2020-10-26 06:02:59,418 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 10 states. [2020-10-26 06:03:00,262 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 10 states. Result 62 states and 73 transitions. Complement of second has 13 states. [2020-10-26 06:03:00,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 1 non-accepting loop states 2 accepting loop states [2020-10-26 06:03:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-26 06:03:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2020-10-26 06:03:00,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 36 transitions. Stem has 25 letters. Loop has 3 letters. [2020-10-26 06:03:00,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:03:00,265 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 06:03:00,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:03:00,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-26 06:03:00,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:03:00,409 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 06:03:00,409 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-10-26 06:03:00,410 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 06:03:00,458 INFO L625 ElimStorePlain]: treesize reduction 10, result has 73.7 percent of original size [2020-10-26 06:03:00,459 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 06:03:00,459 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:28 [2020-10-26 06:03:00,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 06:03:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:03:00,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-26 06:03:00,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:03:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:03:00,886 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2020-10-26 06:03:00,887 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 10 states. [2020-10-26 06:03:01,735 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 10 states. Result 76 states and 90 transitions. Complement of second has 12 states. [2020-10-26 06:03:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 1 non-accepting loop states 2 accepting loop states [2020-10-26 06:03:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-26 06:03:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2020-10-26 06:03:01,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 25 letters. Loop has 3 letters. [2020-10-26 06:03:01,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:03:01,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 28 letters. Loop has 3 letters. [2020-10-26 06:03:01,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:03:01,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 25 letters. Loop has 6 letters. [2020-10-26 06:03:01,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:03:01,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 90 transitions. [2020-10-26 06:03:01,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 06:03:01,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 41 states and 49 transitions. [2020-10-26 06:03:01,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-26 06:03:01,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-26 06:03:01,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2020-10-26 06:03:01,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 06:03:01,748 INFO L691 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-10-26 06:03:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2020-10-26 06:03:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2020-10-26 06:03:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-26 06:03:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-10-26 06:03:01,754 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-10-26 06:03:01,754 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-10-26 06:03:01,754 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-26 06:03:01,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2020-10-26 06:03:01,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 06:03:01,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 06:03:01,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 06:03:01,757 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 06:03:01,758 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 06:03:01,758 INFO L794 eck$LassoCheckResult]: Stem: 2323#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2315#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 2316#L532 assume !(main_~length1~0 < 1); 2317#L532-2 assume !(main_~length2~0 < 1); 2310#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 2311#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 2330#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 2331#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 2327#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 2328#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 2304#L541-4 main_~i~1 := 0; 2305#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 2312#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 2313#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 2314#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 2335#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 2322#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 2306#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 2307#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 2326#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 2334#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 2332#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 2300#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 2301#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 2302#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 2303#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 2309#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 2324#L522-5 [2020-10-26 06:03:01,761 INFO L796 eck$LassoCheckResult]: Loop: 2324#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 2318#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 2319#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 2324#L522-5 [2020-10-26 06:03:01,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:01,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2023300851, now seen corresponding path program 4 times [2020-10-26 06:03:01,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:01,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008337143] [2020-10-26 06:03:01,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:01,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:01,864 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:01,875 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:03:01,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:01,876 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 6 times [2020-10-26 06:03:01,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:01,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110936288] [2020-10-26 06:03:01,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:01,882 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:01,885 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:01,887 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:03:01,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:01,888 INFO L82 PathProgramCache]: Analyzing trace with hash 584676782, now seen corresponding path program 2 times [2020-10-26 06:03:01,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 06:03:01,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260750499] [2020-10-26 06:03:01,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 06:03:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:01,915 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 06:03:01,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 06:03:01,949 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 06:03:02,059 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2020-10-26 06:03:05,117 WARN L193 SmtUtils]: Spent 3.00 s on a formula simplification. DAG size of input: 242 DAG size of output: 182 [2020-10-26 06:03:12,041 WARN L193 SmtUtils]: Spent 6.91 s on a formula simplification. DAG size of input: 148 DAG size of output: 148 [2020-10-26 06:03:12,046 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 06:03:12,046 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 06:03:12,046 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 06:03:12,046 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 06:03:12,046 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 06:03:12,046 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:12,046 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 06:03:12,047 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 06:03:12,047 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration13_Lasso [2020-10-26 06:03:12,047 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 06:03:12,047 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 06:03:12,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:12,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:12,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:12,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:12,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:12,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:12,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:12,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:12,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:12,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:12,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:12,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:12,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:12,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:12,735 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-10-26 06:03:14,283 WARN L193 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2020-10-26 06:03:14,530 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2020-10-26 06:03:14,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:14,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:14,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:14,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:14,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:14,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:14,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:14,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:14,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:14,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:14,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 06:03:14,955 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2020-10-26 06:03:15,199 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2020-10-26 06:03:15,670 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-26 06:03:16,289 WARN L193 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2020-10-26 06:03:16,621 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-10-26 06:03:16,839 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 06:03:16,839 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:16,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:16,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:16,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:16,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:16,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:16,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:16,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:03:16,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:03:16,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:16,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:16,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:03:16,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:16,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:16,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:16,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:03:16,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:03:16,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:16,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:16,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:16,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:03:16,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:16,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:16,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:16,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:03:16,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:03:16,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:16,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:16,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:16,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:03:16,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:16,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:16,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:16,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:03:16,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:03:16,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:16,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:16,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:16,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:16,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:16,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:16,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:16,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:03:16,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:16,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:16,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:16,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:03:16,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:16,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:16,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:16,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:03:16,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:03:16,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:03:17,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:17,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:17,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:03:17,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:17,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:17,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:17,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:03:17,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:03:17,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:17,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:17,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:17,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:03:17,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:17,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:17,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:17,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:03:17,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:03:17,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 06:03:17,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:17,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:17,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:17,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:17,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:17,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:17,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:03:17,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:17,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:17,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:17,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:03:17,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:17,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:17,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:17,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:03:17,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:03:17,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:17,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:17,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:17,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:03:17,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:17,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:17,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:17,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:03:17,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:03:17,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:17,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:17,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:17,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:03:17,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:17,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:17,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:17,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:03:17,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:03:17,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:17,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:17,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:17,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 06:03:17,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:17,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:17,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:17,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 06:03:17,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 06:03:17,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:17,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 06:03:17,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 06:03:17,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 06:03:17,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 06:03:17,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 06:03:17,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 06:03:17,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 06:03:17,248 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 06:03:17,268 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-10-26 06:03:17,269 INFO L444 ModelExtractionUtils]: 30 out of 55 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 06:03:17,272 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 06:03:17,274 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 06:03:17,275 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 06:03:17,275 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_6, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_6 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2020-10-26 06:03:17,506 INFO L297 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2020-10-26 06:03:17,509 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 06:03:17,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:03:17,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 06:03:17,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:03:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:03:17,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 06:03:17,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:03:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:03:17,689 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-10-26 06:03:17,689 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-26 06:03:17,817 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 52 states and 60 transitions. Complement of second has 7 states. [2020-10-26 06:03:17,819 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 [2020-10-26 06:03:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 06:03:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-10-26 06:03:17,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 27 letters. Loop has 3 letters. [2020-10-26 06:03:17,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:03:17,821 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 06:03:17,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:03:17,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 06:03:17,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:03:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:03:17,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 06:03:17,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:03:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:03:17,980 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2020-10-26 06:03:17,980 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-26 06:03:18,086 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 52 states and 60 transitions. Complement of second has 7 states. [2020-10-26 06:03:18,088 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 [2020-10-26 06:03:18,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 06:03:18,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-10-26 06:03:18,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 27 letters. Loop has 3 letters. [2020-10-26 06:03:18,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:03:18,089 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 06:03:18,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 06:03:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:03:18,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 06:03:18,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:03:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 06:03:18,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 06:03:18,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 06:03:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 06:03:18,268 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-10-26 06:03:18,268 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-26 06:03:18,374 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 51 states and 60 transitions. Complement of second has 6 states. [2020-10-26 06:03:18,376 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 [2020-10-26 06:03:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 06:03:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-10-26 06:03:18,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 27 letters. Loop has 3 letters. [2020-10-26 06:03:18,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:03:18,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 30 letters. Loop has 3 letters. [2020-10-26 06:03:18,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:03:18,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 27 letters. Loop has 6 letters. [2020-10-26 06:03:18,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 06:03:18,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2020-10-26 06:03:18,378 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 06:03:18,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 0 states and 0 transitions. [2020-10-26 06:03:18,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 06:03:18,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 06:03:18,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 06:03:18,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 06:03:18,379 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 06:03:18,379 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 06:03:18,379 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 06:03:18,379 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-26 06:03:18,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 06:03:18,379 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 06:03:18,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 06:03:18,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 06:03:18 BoogieIcfgContainer [2020-10-26 06:03:18,385 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 06:03:18,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 06:03:18,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 06:03:18,387 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 06:03:18,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:02:20" (3/4) ... [2020-10-26 06:03:18,390 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 06:03:18,390 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 06:03:18,391 INFO L168 Benchmark]: Toolchain (without parser) took 59053.95 ms. Allocated memory was 54.5 MB in the beginning and 251.7 MB in the end (delta: 197.1 MB). Free memory was 30.6 MB in the beginning and 98.9 MB in the end (delta: -68.3 MB). Peak memory consumption was 129.1 MB. Max. memory is 16.1 GB. [2020-10-26 06:03:18,392 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 44.0 MB. Free memory was 23.6 MB in the beginning and 23.6 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:03:18,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 642.52 ms. Allocated memory is still 54.5 MB. Free memory was 30.0 MB in the beginning and 35.0 MB in the end (delta: -5.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. [2020-10-26 06:03:18,392 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.95 ms. Allocated memory is still 54.5 MB. Free memory was 34.8 MB in the beginning and 32.9 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:03:18,393 INFO L168 Benchmark]: Boogie Preprocessor took 33.79 ms. Allocated memory is still 54.5 MB. Free memory was 32.9 MB in the beginning and 31.5 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:03:18,393 INFO L168 Benchmark]: RCFGBuilder took 588.93 ms. Allocated memory is still 54.5 MB. Free memory was 31.5 MB in the beginning and 26.6 MB in the end (delta: 4.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. [2020-10-26 06:03:18,393 INFO L168 Benchmark]: BuchiAutomizer took 57713.65 ms. Allocated memory was 54.5 MB in the beginning and 251.7 MB in the end (delta: 197.1 MB). Free memory was 26.4 MB in the beginning and 99.9 MB in the end (delta: -73.6 MB). Peak memory consumption was 124.2 MB. Max. memory is 16.1 GB. [2020-10-26 06:03:18,394 INFO L168 Benchmark]: Witness Printer took 4.18 ms. Allocated memory is still 251.7 MB. Free memory was 99.9 MB in the beginning and 98.9 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 06:03:18,396 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 44.0 MB. Free memory was 23.6 MB in the beginning and 23.6 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 642.52 ms. Allocated memory is still 54.5 MB. Free memory was 30.0 MB in the beginning and 35.0 MB in the end (delta: -5.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.95 ms. Allocated memory is still 54.5 MB. Free memory was 34.8 MB in the beginning and 32.9 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.79 ms. Allocated memory is still 54.5 MB. Free memory was 32.9 MB in the beginning and 31.5 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 588.93 ms. Allocated memory is still 54.5 MB. Free memory was 31.5 MB in the beginning and 26.6 MB in the end (delta: 4.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 57713.65 ms. Allocated memory was 54.5 MB in the beginning and 251.7 MB in the end (delta: 197.1 MB). Free memory was 26.4 MB in the beginning and 99.9 MB in the end (delta: -73.6 MB). Peak memory consumption was 124.2 MB. Max. memory is 16.1 GB. * Witness Printer took 4.18 ms. Allocated memory is still 251.7 MB. Free memory was 99.9 MB in the beginning and 98.9 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (7 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString2] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s and consists of 11 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 5 locations. 7 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 57.6s and 14 iterations. TraceHistogramMax:2. Analysis of lassos took 49.3s. Construction of modules took 1.2s. Büchi inclusion checks took 6.7s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 36 states and ocurred in iteration 12. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 295 SDtfs, 775 SDslu, 658 SDs, 0 SdLazy, 858 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI1 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital462 mio100 ax106 hnf98 lsp128 ukn54 mio100 lsp50 div108 bol100 ite100 ukn100 eq176 hnf86 smp85 dnf544 smp52 tf100 neg98 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...