./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.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 1f6e8c8b965f85c3429105401e9fda59f9f060cb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:57:22,680 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:57:22,681 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:57:22,693 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:57:22,693 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:57:22,694 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:57:22,696 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:57:22,698 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:57:22,699 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:57:22,700 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:57:22,701 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:57:22,702 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:57:22,702 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:57:22,703 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:57:22,705 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:57:22,705 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:57:22,707 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:57:22,709 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:57:22,711 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:57:22,713 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:57:22,715 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:57:22,717 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:57:22,719 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:57:22,719 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:57:22,720 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:57:22,721 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:57:22,722 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:57:22,723 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:57:22,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:57:22,726 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:57:22,726 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:57:22,727 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:57:22,727 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:57:22,727 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:57:22,728 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:57:22,730 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:57:22,730 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:57:22,754 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:57:22,755 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:57:22,756 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:57:22,757 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:57:22,757 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:57:22,758 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:57:22,758 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:57:22,758 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:57:22,758 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:57:22,758 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:57:22,759 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:57:22,760 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:57:22,761 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:57:22,761 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:57:22,761 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:57:22,761 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:57:22,761 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:57:22,762 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:57:22,764 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:57:22,764 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:57:22,764 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:57:22,764 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:57:22,764 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:57:22,765 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:57:22,765 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:57:22,765 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:57:22,765 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:57:22,765 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:57:22,766 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:57:22,766 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:57:22,766 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:57:22,769 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:57:22,770 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> 1f6e8c8b965f85c3429105401e9fda59f9f060cb [2019-01-14 04:57:22,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:57:22,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:57:22,849 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:57:22,851 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:57:22,852 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:57:22,853 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:22,913 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26e791225/dd36f3d71eaf4fbfafba6782d82a717f/FLAG3f576e786 [2019-01-14 04:57:23,422 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:57:23,422 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:23,440 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26e791225/dd36f3d71eaf4fbfafba6782d82a717f/FLAG3f576e786 [2019-01-14 04:57:23,725 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26e791225/dd36f3d71eaf4fbfafba6782d82a717f [2019-01-14 04:57:23,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:57:23,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:57:23,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:23,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:57:23,738 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:57:23,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:23" (1/1) ... [2019-01-14 04:57:23,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff617d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:23, skipping insertion in model container [2019-01-14 04:57:23,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:23" (1/1) ... [2019-01-14 04:57:23,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:57:23,812 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:57:24,116 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:24,128 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:57:24,211 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:24,349 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:57:24,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24 WrapperNode [2019-01-14 04:57:24,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:24,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:24,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:57:24,352 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:57:24,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:24,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:57:24,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:57:24,404 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:57:24,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (1/1) ... [2019-01-14 04:57:24,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:57:24,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:57:24,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:57:24,439 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:57:24,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (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 [2019-01-14 04:57:24,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:57:24,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:57:24,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:57:24,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:57:24,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:57:24,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:57:24,932 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:57:24,933 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 04:57:24,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:24 BoogieIcfgContainer [2019-01-14 04:57:24,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:57:24,935 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:57:24,935 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:57:24,939 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:57:24,939 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:24,940 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:57:23" (1/3) ... [2019-01-14 04:57:24,941 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@80bb77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:24, skipping insertion in model container [2019-01-14 04:57:24,941 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:24,941 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:24" (2/3) ... [2019-01-14 04:57:24,942 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@80bb77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:24, skipping insertion in model container [2019-01-14 04:57:24,942 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:24,942 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:24" (3/3) ... [2019-01-14 04:57:24,945 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:25,002 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:57:25,002 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:57:25,003 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:57:25,003 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:57:25,003 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:57:25,003 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:57:25,003 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:57:25,003 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:57:25,004 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:57:25,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 04:57:25,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 04:57:25,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:25,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:25,046 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:25,046 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:57:25,046 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:57:25,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 04:57:25,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 04:57:25,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:25,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:25,049 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:25,049 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:57:25,059 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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~ret14, 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; 3#L558true assume !(main_~length1~0 < 1); 6#L558-2true assume !(main_~length2~0 < 1); 19#L561-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;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; 15#L545-4true [2019-01-14 04:57:25,059 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 8#L545-1true 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; 9#L548-5true assume !true; 12#L548-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 18#L550true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 13#L545-3true 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; 15#L545-4true [2019-01-14 04:57:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 04:57:25,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:25,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:25,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:25,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:25,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:25,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-01-14 04:57:25,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:25,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:25,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:25,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:25,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:57:25,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:57:25,267 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:57:25,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 04:57:25,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 04:57:25,290 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-14 04:57:25,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:57:25,300 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-14 04:57:25,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:57:25,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-14 04:57:25,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 04:57:25,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-01-14 04:57:25,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 04:57:25,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 04:57:25,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-14 04:57:25,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:25,315 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 04:57:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-14 04:57:25,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 04:57:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 04:57:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-14 04:57:25,353 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 04:57:25,353 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 04:57:25,353 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:57:25,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-14 04:57:25,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 04:57:25,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:25,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:25,356 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:25,356 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:25,357 INFO L794 eck$LassoCheckResult]: Stem: 56#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 52#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~ret14, 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; 44#L558 assume !(main_~length1~0 < 1); 45#L558-2 assume !(main_~length2~0 < 1); 48#L561-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;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; 55#L545-4 [2019-01-14 04:57:25,357 INFO L796 eck$LassoCheckResult]: Loop: 55#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 51#L545-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; 50#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 46#L548-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); 47#L548-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6; 49#L548-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 53#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 54#L545-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; 55#L545-4 [2019-01-14 04:57:25,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:25,357 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-14 04:57:25,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:25,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:25,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:25,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:25,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:25,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-01-14 04:57:25,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:25,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:25,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:25,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:25,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:25,460 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-01-14 04:57:25,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:25,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:25,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:25,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:26,328 WARN L181 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-01-14 04:57:26,797 WARN L181 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-01-14 04:57:27,562 WARN L181 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-14 04:57:27,701 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 04:57:27,721 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:27,722 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:27,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:27,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:27,723 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:27,723 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:27,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:27,724 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:27,725 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-14 04:57:27,725 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:27,725 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:27,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:27,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:27,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:27,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:27,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:27,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:27,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:27,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:27,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:27,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:27,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:27,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:27,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:27,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:27,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:28,305 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-01-14 04:57:28,658 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-14 04:57:28,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:28,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:28,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:29,672 WARN L181 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 04:57:30,047 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-01-14 04:57:30,064 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:30,070 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:30,072 INFO L122 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 [2019-01-14 04:57:30,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,080 INFO L122 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 [2019-01-14 04:57:30,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:30,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:30,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,089 INFO L122 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 [2019-01-14 04:57:30,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,094 INFO L122 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 [2019-01-14 04:57:30,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,100 INFO L122 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 [2019-01-14 04:57:30,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,103 INFO L122 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 [2019-01-14 04:57:30,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,110 INFO L122 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 [2019-01-14 04:57:30,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,116 INFO L122 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 [2019-01-14 04:57:30,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,122 INFO L122 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 [2019-01-14 04:57:30,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:30,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:30,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,131 INFO L122 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 [2019-01-14 04:57:30,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,136 INFO L122 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 [2019-01-14 04:57:30,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,144 INFO L122 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 [2019-01-14 04:57:30,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,156 INFO L122 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 [2019-01-14 04:57:30,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,164 INFO L122 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 [2019-01-14 04:57:30,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,167 INFO L122 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 [2019-01-14 04:57:30,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:30,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:30,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,186 INFO L122 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 [2019-01-14 04:57:30,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,191 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 04:57:30,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,203 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:57:30,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:30,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,251 INFO L122 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 [2019-01-14 04:57:30,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:30,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:30,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,272 INFO L122 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 [2019-01-14 04:57:30,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:30,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:30,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:30,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,280 INFO L122 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 [2019-01-14 04:57:30,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:30,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:30,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,295 INFO L122 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 [2019-01-14 04:57:30,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:30,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:30,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:30,326 INFO L122 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 [2019-01-14 04:57:30,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:30,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:30,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:30,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:30,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:30,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:30,379 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:30,421 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 04:57:30,422 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:57:30,424 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:30,426 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:30,426 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:30,428 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2019-01-14 04:57:30,531 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 04:57:30,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:57:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:30,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:30,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:30,648 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 [2019-01-14 04:57:30,649 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 04:57:30,711 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-01-14 04:57:30,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:57:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-14 04:57:30,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-14 04:57:30,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:30,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-14 04:57:30,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:30,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-01-14 04:57:30,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:30,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-14 04:57:30,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:30,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-01-14 04:57:30,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 04:57:30,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 04:57:30,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-14 04:57:30,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:30,722 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 04:57:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-14 04:57:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-14 04:57:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 04:57:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-14 04:57:30,726 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 04:57:30,726 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 04:57:30,726 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:57:30,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-14 04:57:30,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:30,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:30,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:30,730 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:30,730 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:30,730 INFO L794 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 185#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~ret14, 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; 173#L558 assume !(main_~length1~0 < 1); 174#L558-2 assume !(main_~length2~0 < 1); 179#L561-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;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; 190#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 183#L545-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; 180#L548-5 [2019-01-14 04:57:30,730 INFO L796 eck$LassoCheckResult]: Loop: 180#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 175#L548-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); 176#L548-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;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; 180#L548-5 [2019-01-14 04:57:30,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:30,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-01-14 04:57:30,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:30,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:30,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:30,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:30,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:30,760 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-01-14 04:57:30,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:30,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:30,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:30,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:30,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-01-14 04:57:30,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:30,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:30,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:30,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:30,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:31,010 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 04:57:31,141 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 04:57:31,511 WARN L181 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-01-14 04:57:31,666 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-01-14 04:57:31,669 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:31,669 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:31,669 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:31,669 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:31,669 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:31,669 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:31,670 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:31,670 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:31,670 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-14 04:57:31,670 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:31,670 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:31,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:31,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:31,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:31,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:31,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:31,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:31,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:31,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:31,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:31,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:31,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:31,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:31,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:31,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:31,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:32,126 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-01-14 04:57:32,474 WARN L181 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-14 04:57:32,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:32,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:32,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:33,445 WARN L181 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 04:57:33,703 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 04:57:33,894 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 04:57:33,929 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:33,929 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:33,930 INFO L122 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 [2019-01-14 04:57:33,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:33,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:33,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:33,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:33,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:33,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:33,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:33,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:33,937 INFO L122 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 [2019-01-14 04:57:33,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:33,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:33,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:33,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:33,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:33,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:33,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:33,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:33,942 INFO L122 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 [2019-01-14 04:57:33,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:33,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:33,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:33,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:33,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:33,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:33,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:33,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:33,947 INFO L122 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 [2019-01-14 04:57:33,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:33,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:33,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:33,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:33,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:33,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:33,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:33,953 INFO L122 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 [2019-01-14 04:57:33,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:33,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:33,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:33,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:33,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:33,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:33,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:33,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:33,959 INFO L122 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 [2019-01-14 04:57:33,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:33,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:33,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:33,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:33,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:33,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:33,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:33,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:33,964 INFO L122 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 [2019-01-14 04:57:33,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:33,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:33,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:33,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:33,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:33,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:33,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:33,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:33,969 INFO L122 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 [2019-01-14 04:57:33,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:33,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:33,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:33,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:33,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:33,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:33,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:33,976 INFO L122 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 [2019-01-14 04:57:33,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:33,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:33,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:33,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:33,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:33,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:33,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:33,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:33,982 INFO L122 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 [2019-01-14 04:57:33,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:33,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:33,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:33,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:33,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:33,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:33,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:33,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:33,987 INFO L122 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 [2019-01-14 04:57:33,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:33,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:33,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:33,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:33,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:33,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:33,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:33,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:33,992 INFO L122 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 [2019-01-14 04:57:33,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:33,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:33,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:33,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:33,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:33,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:33,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:33,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:33,997 INFO L122 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 [2019-01-14 04:57:33,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:33,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:33,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:33,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:33,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:33,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:34,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:34,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:34,003 INFO L122 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 [2019-01-14 04:57:34,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:34,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:34,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:34,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:34,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:34,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:34,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:34,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:34,008 INFO L122 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 [2019-01-14 04:57:34,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:34,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:34,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:34,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:34,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:34,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:34,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:34,015 INFO L122 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 [2019-01-14 04:57:34,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:34,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:34,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:34,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:34,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:34,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:34,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:34,025 INFO L122 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 [2019-01-14 04:57:34,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:34,026 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 04:57:34,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:34,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:34,033 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:57:34,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:34,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:34,055 INFO L122 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 [2019-01-14 04:57:34,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:34,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:34,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:34,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:34,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:34,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:34,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:34,062 INFO L122 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 [2019-01-14 04:57:34,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:34,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:34,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:34,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:34,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:34,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:34,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:34,068 INFO L122 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 [2019-01-14 04:57:34,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:34,069 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:57:34,069 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-14 04:57:34,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:34,094 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-01-14 04:57:34,095 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-14 04:57:34,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:34,188 INFO L122 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 [2019-01-14 04:57:34,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:34,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:34,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:34,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:34,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:34,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:34,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:34,195 INFO L122 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 [2019-01-14 04:57:34,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:34,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:34,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:34,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:34,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:34,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:34,217 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:34,247 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 04:57:34,247 INFO L444 ModelExtractionUtils]: 37 out of 46 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-14 04:57:34,251 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:34,252 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:34,252 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:34,252 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-01-14 04:57:34,408 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-01-14 04:57:34,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:57:34,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:34,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:34,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:34,525 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 [2019-01-14 04:57:34,525 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-14 04:57:34,642 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2019-01-14 04:57:34,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:57:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:57:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 04:57:34,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 04:57:34,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:34,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-14 04:57:34,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:34,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-14 04:57:34,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:34,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-14 04:57:34,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:34,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-01-14 04:57:34,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 04:57:34,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 04:57:34,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-14 04:57:34,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:34,649 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-14 04:57:34,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-14 04:57:34,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-14 04:57:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 04:57:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-14 04:57:34,652 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 04:57:34,652 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 04:57:34,653 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:57:34,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-14 04:57:34,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:34,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:34,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:34,654 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:34,654 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:34,655 INFO L794 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 366#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~ret14, 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; 353#L558 assume !(main_~length1~0 < 1); 354#L558-2 assume !(main_~length2~0 < 1); 359#L561-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;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; 371#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 372#L545-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; 374#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 375#L548-1 assume !cstrspn_#t~short7; 361#L548-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6; 362#L548-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 367#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 368#L545-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; 369#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 363#L545-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; 360#L548-5 [2019-01-14 04:57:34,655 INFO L796 eck$LassoCheckResult]: Loop: 360#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 355#L548-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); 356#L548-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;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; 360#L548-5 [2019-01-14 04:57:34,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:34,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-01-14 04:57:34,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:34,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:34,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:34,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:35,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:57:35,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 04:57:35,186 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:57:35,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:35,187 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-01-14 04:57:35,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:35,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:35,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:35,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:35,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:35,544 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 04:57:35,675 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 04:57:35,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:57:35,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:57:35,677 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-14 04:57:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:57:35,772 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-01-14 04:57:35,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 04:57:35,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-01-14 04:57:35,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:57:35,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-01-14 04:57:35,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 04:57:35,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 04:57:35,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-01-14 04:57:35,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:35,777 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-14 04:57:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-01-14 04:57:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-01-14 04:57:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 04:57:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-01-14 04:57:35,780 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-14 04:57:35,780 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-14 04:57:35,780 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:57:35,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-01-14 04:57:35,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:35,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:35,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:35,784 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:35,784 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:35,784 INFO L794 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 439#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~ret14, 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; 425#L558 assume !(main_~length1~0 < 1); 426#L558-2 assume !(main_~length2~0 < 1); 431#L561-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;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; 445#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 446#L545-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; 437#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 438#L548-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); 447#L548-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6; 440#L548-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 441#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 442#L545-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; 443#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 435#L545-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; 432#L548-5 [2019-01-14 04:57:35,784 INFO L796 eck$LassoCheckResult]: Loop: 432#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 427#L548-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); 428#L548-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;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; 432#L548-5 [2019-01-14 04:57:35,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:35,785 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-01-14 04:57:35,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:35,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:35,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:35,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:35,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:35,842 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-01-14 04:57:35,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:35,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:35,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:35,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:35,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:35,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:35,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-01-14 04:57:35,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:35,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:35,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:35,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:35,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:36,316 WARN L181 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 04:57:37,133 WARN L181 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 138 [2019-01-14 04:57:38,308 WARN L181 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2019-01-14 04:57:38,314 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:38,314 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:38,314 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:38,314 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:38,314 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:38,314 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:38,314 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:38,315 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:38,315 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2019-01-14 04:57:38,315 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:38,315 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:38,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:38,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:38,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:38,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:38,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:38,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:38,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:38,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:38,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:38,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:38,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:38,693 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 04:57:39,655 WARN L181 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-01-14 04:57:39,814 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-01-14 04:57:39,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:39,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:39,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:39,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:39,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:39,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:39,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:40,027 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-14 04:57:40,407 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-14 04:57:40,894 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-01-14 04:57:41,123 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 04:57:41,580 WARN L181 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 04:57:41,768 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:41,769 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:41,769 INFO L122 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 [2019-01-14 04:57:41,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:41,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:41,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:41,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,776 INFO L122 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 [2019-01-14 04:57:41,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:41,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:41,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,783 INFO L122 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 [2019-01-14 04:57:41,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:41,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:41,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:41,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,788 INFO L122 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 [2019-01-14 04:57:41,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:41,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:41,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:41,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,794 INFO L122 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 [2019-01-14 04:57:41,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:41,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:41,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:41,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,796 INFO L122 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 [2019-01-14 04:57:41,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:41,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:41,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:41,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,803 INFO L122 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 [2019-01-14 04:57:41,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:41,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:41,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:41,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,808 INFO L122 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 [2019-01-14 04:57:41,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:41,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:41,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,812 INFO L122 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 [2019-01-14 04:57:41,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:41,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:41,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:41,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,816 INFO L122 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 [2019-01-14 04:57:41,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:41,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:41,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:41,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:41,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,826 INFO L122 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 [2019-01-14 04:57:41,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,827 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 04:57:41,827 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-14 04:57:41,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:41,847 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-01-14 04:57:41,847 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-14 04:57:41,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:41,996 INFO L122 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 [2019-01-14 04:57:41,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:41,997 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 04:57:41,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:41,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:42,003 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:57:42,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:42,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:42,031 INFO L122 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 [2019-01-14 04:57:42,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:42,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:42,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:42,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:42,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:42,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:42,065 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:42,108 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 04:57:42,111 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:57:42,111 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:42,112 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:42,112 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:42,112 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-01-14 04:57:42,298 INFO L297 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2019-01-14 04:57:42,300 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:57:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:42,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:42,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:42,377 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 [2019-01-14 04:57:42,377 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 04:57:42,424 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2019-01-14 04:57:42,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:57:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:57:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 04:57:42,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 04:57:42,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:42,427 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:57:42,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:42,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:42,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:42,511 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 04:57:42,511 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 04:57:42,568 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2019-01-14 04:57:42,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:57:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:57:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 04:57:42,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 04:57:42,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:42,571 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:57:42,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:42,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:42,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:42,647 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 04:57:42,647 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 04:57:42,712 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2019-01-14 04:57:42,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:57:42,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:57:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-14 04:57:42,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 04:57:42,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:42,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-14 04:57:42,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:42,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-14 04:57:42,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:42,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-01-14 04:57:42,719 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:42,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-01-14 04:57:42,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:57:42,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:57:42,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:57:42,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:42,719 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:42,720 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:42,720 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:42,720 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:57:42,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:57:42,720 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:42,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:57:42,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:57:42 BoogieIcfgContainer [2019-01-14 04:57:42,731 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:57:42,731 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:57:42,731 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:57:42,732 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:57:42,732 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:24" (3/4) ... [2019-01-14 04:57:42,736 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:57:42,736 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:57:42,738 INFO L168 Benchmark]: Toolchain (without parser) took 19005.22 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 366.5 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -91.6 MB). Peak memory consumption was 274.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:42,739 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:57:42,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:42,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:42,741 INFO L168 Benchmark]: Boogie Preprocessor took 35.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:57:42,741 INFO L168 Benchmark]: RCFGBuilder took 495.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:42,742 INFO L168 Benchmark]: BuchiAutomizer took 17796.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.4 MB). Peak memory consumption was 284.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:42,744 INFO L168 Benchmark]: Witness Printer took 4.56 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:57:42,749 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 616.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 495.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17796.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.4 MB). Peak memory consumption was 284.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.56 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[sc1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 16.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 139 SDslu, 72 SDs, 0 SdLazy, 102 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital375 mio100 ax100 hnf99 lsp91 ukn72 mio100 lsp31 div131 bol100 ite100 ukn100 eq165 hnf81 smp92 dnf666 smp43 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 168ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...