./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 64bit --witnessprinter.graph.data.programhash 51c86dc5019658537c4cb35ed62637baeb91c588 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:21:29,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:21:29,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:21:29,909 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:21:29,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:21:29,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:21:29,913 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:21:29,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:21:29,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:21:29,921 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:21:29,924 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:21:29,924 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:21:29,925 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:21:29,926 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:21:29,930 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:21:29,931 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:21:29,932 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:21:29,936 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:21:29,943 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:21:29,949 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:21:29,950 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:21:29,952 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:21:29,956 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:21:29,958 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:21:29,958 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:21:29,959 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:21:29,960 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:21:29,961 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:21:29,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:21:29,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:21:29,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:21:29,968 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:21:29,969 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:21:29,970 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:21:29,971 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:21:29,971 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:21:29,973 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:21:30,001 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:21:30,002 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:21:30,003 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:21:30,005 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:21:30,005 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:21:30,006 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:21:30,006 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:21:30,007 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:21:30,007 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:21:30,007 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:21:30,007 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:21:30,008 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:21:30,008 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:21:30,008 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:21:30,009 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:21:30,009 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:21:30,009 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:21:30,009 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:21:30,009 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:21:30,010 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:21:30,011 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:21:30,011 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:21:30,011 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:21:30,011 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:21:30,011 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:21:30,012 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:21:30,012 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:21:30,012 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:21:30,014 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:21:30,014 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51c86dc5019658537c4cb35ed62637baeb91c588 [2018-11-28 23:21:30,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:21:30,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:21:30,088 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:21:30,089 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:21:30,090 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:21:30,090 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i [2018-11-28 23:21:30,157 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd125515/6e60087541294316bd7903bf369d47c5/FLAG9b05eabfd [2018-11-28 23:21:30,646 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:21:30,647 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i [2018-11-28 23:21:30,663 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd125515/6e60087541294316bd7903bf369d47c5/FLAG9b05eabfd [2018-11-28 23:21:30,967 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd125515/6e60087541294316bd7903bf369d47c5 [2018-11-28 23:21:30,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:21:30,972 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:21:30,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:30,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:21:30,977 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:21:30,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:30" (1/1) ... [2018-11-28 23:21:30,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb0bef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:30, skipping insertion in model container [2018-11-28 23:21:30,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:30" (1/1) ... [2018-11-28 23:21:30,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:21:31,042 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:21:31,447 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:31,465 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:21:31,514 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:31,661 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:21:31,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:31 WrapperNode [2018-11-28 23:21:31,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:31,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:31,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:21:31,663 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:21:31,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:31" (1/1) ... [2018-11-28 23:21:31,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:31" (1/1) ... [2018-11-28 23:21:31,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:31,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:21:31,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:21:31,729 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:21:31,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:31" (1/1) ... [2018-11-28 23:21:31,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:31" (1/1) ... [2018-11-28 23:21:31,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:31" (1/1) ... [2018-11-28 23:21:31,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:31" (1/1) ... [2018-11-28 23:21:31,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:31" (1/1) ... [2018-11-28 23:21:31,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:31" (1/1) ... [2018-11-28 23:21:31,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:31" (1/1) ... [2018-11-28 23:21:31,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:21:31,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:21:31,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:21:31,770 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:21:31,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:31" (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 [2018-11-28 23:21:31,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:21:31,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:21:31,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:21:31,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:21:31,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:21:31,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:21:32,256 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:21:32,256 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:21:32,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:32 BoogieIcfgContainer [2018-11-28 23:21:32,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:21:32,259 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:21:32,259 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:21:32,263 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:21:32,264 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:32,264 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:21:30" (1/3) ... [2018-11-28 23:21:32,265 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c330dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:32, skipping insertion in model container [2018-11-28 23:21:32,265 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:32,265 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:31" (2/3) ... [2018-11-28 23:21:32,267 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c330dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:32, skipping insertion in model container [2018-11-28 23:21:32,267 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:32,267 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:32" (3/3) ... [2018-11-28 23:21:32,269 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-termination.c.i [2018-11-28 23:21:32,332 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:21:32,333 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:21:32,333 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:21:32,333 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:21:32,333 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:21:32,333 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:21:32,333 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:21:32,334 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:21:32,334 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:21:32,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:21:32,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:21:32,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:32,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:32,378 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:21:32,378 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:21:32,379 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:21:32,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:21:32,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:21:32,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:32,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:32,381 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:21:32,382 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:21:32,391 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 4#L566true assume !(main_~length~0 < 1); 9#L566-2true assume !(main_~n~0 < 1); 3#L569-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 16#L550true assume 0 != cstrncpy_~n % 4294967296;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 18#L553-4true [2018-11-28 23:21:32,392 INFO L796 eck$LassoCheckResult]: Loop: 18#L553-4true cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 6#L554true assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset; 12#L553-1true cstrncpy_#t~pre2 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 13#L553-2true assume !!(0 != cstrncpy_#t~pre2 % 4294967296);havoc cstrncpy_#t~pre2; 18#L553-4true [2018-11-28 23:21:32,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:32,399 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-11-28 23:21:32,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:32,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:32,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:32,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:32,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:32,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:32,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1618712, now seen corresponding path program 1 times [2018-11-28 23:21:32,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:32,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:32,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:32,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:32,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:32,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:32,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1592246563, now seen corresponding path program 1 times [2018-11-28 23:21:32,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:32,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:32,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:32,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:32,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:33,029 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-28 23:21:33,210 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-28 23:21:34,128 WARN L180 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2018-11-28 23:21:34,304 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-11-28 23:21:34,318 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:34,320 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:34,320 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:34,320 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:34,320 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:34,320 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:34,321 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:34,321 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:34,321 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:21:34,321 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:34,321 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:34,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:34,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:34,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:34,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:34,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:34,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:34,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:34,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:34,967 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-11-28 23:21:35,194 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-11-28 23:21:35,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:35,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:35,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:35,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:35,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:35,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:35,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:35,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:35,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:35,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:35,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:35,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:35,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:35,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:35,725 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-11-28 23:21:35,899 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-11-28 23:21:36,243 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-28 23:21:36,533 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:36,539 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:36,542 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 [2018-11-28 23:21:36,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:36,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:36,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:36,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:36,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:36,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:36,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:36,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:36,552 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 [2018-11-28 23:21:36,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:36,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:36,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:36,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:36,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:36,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:36,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:36,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:36,557 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 [2018-11-28 23:21:36,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:36,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:36,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:36,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:36,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:36,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:36,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:36,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:36,562 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 [2018-11-28 23:21:36,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:36,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:36,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:36,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:36,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:36,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:36,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:36,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:36,567 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 [2018-11-28 23:21:36,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:36,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:36,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:36,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:36,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:36,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:36,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:36,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:36,572 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 [2018-11-28 23:21:36,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:36,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:36,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:36,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:36,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:36,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:36,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:36,585 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 [2018-11-28 23:21:36,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:36,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:36,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:36,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:36,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:36,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:36,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:36,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:36,591 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 [2018-11-28 23:21:36,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:36,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:36,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:36,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:36,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:36,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:36,772 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:36,861 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:21:36,862 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:21:36,864 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:36,866 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:21:36,867 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:36,867 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1) = -1*ULTIMATE.start_cstrncpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 Supporting invariants [] [2018-11-28 23:21:37,204 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-28 23:21:37,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:21:37,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:37,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:37,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:37,687 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 [2018-11-28 23:21:37,688 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-11-28 23:21:37,854 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 36 states and 44 transitions. Complement of second has 7 states. [2018-11-28 23:21:37,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:21:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:21:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-28 23:21:37,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:21:37,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:37,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:21:37,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:37,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 23:21:37,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:37,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-11-28 23:21:37,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:21:37,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 14 states and 17 transitions. [2018-11-28 23:21:37,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:21:37,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:21:37,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-28 23:21:37,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:21:37,876 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 23:21:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-28 23:21:37,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-28 23:21:37,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:21:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-28 23:21:37,900 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 23:21:37,900 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 23:21:37,900 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:21:37,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-28 23:21:37,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:21:37,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:37,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:37,902 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:21:37,902 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:21:37,902 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 169#L566 assume !(main_~length~0 < 1); 170#L566-2 assume !(main_~n~0 < 1); 171#L569-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 177#L550 assume 0 != cstrncpy_~n % 4294967296;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 179#L553-4 cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 180#L554 assume 0 == cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset; 175#L555-3 [2018-11-28 23:21:37,902 INFO L796 eck$LassoCheckResult]: Loop: 175#L555-3 cstrncpy_#t~pre6 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 176#L555-1 assume !!(0 != cstrncpy_#t~pre6 % 4294967296);havoc cstrncpy_#t~pre6;cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post7.base, 1 + cstrncpy_#t~post7.offset;call write~int(0, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, 1);havoc cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset; 175#L555-3 [2018-11-28 23:21:37,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:37,903 INFO L82 PathProgramCache]: Analyzing trace with hash 180427599, now seen corresponding path program 1 times [2018-11-28 23:21:37,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:37,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:37,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:37,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:37,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:37,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2018-11-28 23:21:37,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:37,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:37,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:37,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:37,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231764, now seen corresponding path program 1 times [2018-11-28 23:21:37,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:37,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:37,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:37,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:38,137 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 23:21:38,860 WARN L180 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 120 [2018-11-28 23:21:39,063 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-28 23:21:39,066 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:39,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:39,067 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:39,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:39,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:39,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:39,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:39,067 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:39,067 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:21:39,067 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:39,069 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:39,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,483 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-11-28 23:21:39,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:39,890 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-11-28 23:21:40,020 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-28 23:21:40,185 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-28 23:21:40,447 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-28 23:21:40,673 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:40,673 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:40,674 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 [2018-11-28 23:21:40,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:40,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:40,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:40,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,680 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 [2018-11-28 23:21:40,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:40,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:40,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:40,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,686 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 [2018-11-28 23:21:40,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:40,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:40,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,694 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 [2018-11-28 23:21:40,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:40,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:40,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:40,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,700 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 [2018-11-28 23:21:40,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:40,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:40,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:40,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,706 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 [2018-11-28 23:21:40,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:40,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:40,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,714 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 [2018-11-28 23:21:40,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:40,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:40,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:40,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,719 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 [2018-11-28 23:21:40,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:40,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:40,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:40,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,725 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 [2018-11-28 23:21:40,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:40,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:40,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:40,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,732 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 [2018-11-28 23:21:40,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:40,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:40,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,739 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 [2018-11-28 23:21:40,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:40,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:40,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:40,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,746 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 [2018-11-28 23:21:40,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:40,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:40,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:40,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:40,752 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 [2018-11-28 23:21:40,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:40,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:40,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:40,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:40,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:40,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:40,797 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:40,842 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:21:40,843 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:21:40,843 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:40,844 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:21:40,846 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:40,846 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2) = -1*ULTIMATE.start_cstrncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 Supporting invariants [] [2018-11-28 23:21:41,118 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2018-11-28 23:21:41,143 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:21:41,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:41,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:41,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:41,226 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2018-11-28 23:21:41,227 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-28 23:21:41,382 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 15 states and 19 transitions. Complement of second has 6 states. [2018-11-28 23:21:41,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:21:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:21:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-28 23:21:41,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:21:41,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:41,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 23:21:41,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:41,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 23:21:41,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:41,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-28 23:21:41,388 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:21:41,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-11-28 23:21:41,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:21:41,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:21:41,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:21:41,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:21:41,388 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:21:41,388 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:21:41,388 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:21:41,389 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:21:41,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:21:41,389 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:21:41,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:21:41,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:21:41 BoogieIcfgContainer [2018-11-28 23:21:41,396 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:21:41,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:21:41,396 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:21:41,397 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:21:41,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:32" (3/4) ... [2018-11-28 23:21:41,401 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:21:41,401 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:21:41,402 INFO L168 Benchmark]: Toolchain (without parser) took 10430.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.6 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -236.1 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:41,404 INFO L168 Benchmark]: CDTParser took 0.15 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. [2018-11-28 23:21:41,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 689.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -185.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:41,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.58 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. [2018-11-28 23:21:41,406 INFO L168 Benchmark]: Boogie Preprocessor took 40.84 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. [2018-11-28 23:21:41,407 INFO L168 Benchmark]: RCFGBuilder took 487.60 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.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:41,407 INFO L168 Benchmark]: BuchiAutomizer took 9137.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.2 MB). Peak memory consumption was 84.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:41,408 INFO L168 Benchmark]: Witness Printer took 5.32 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:21:41,414 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.15 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 689.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -185.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.58 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 40.84 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 487.60 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.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9137.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.2 MB). Peak memory consumption was 84.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.32 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 8.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 37 SDslu, 26 SDs, 0 SdLazy, 16 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital231 mio100 ax107 hnf99 lsp90 ukn84 mio100 lsp52 div181 bol100 ite100 ukn100 eq173 hnf68 smp93 dnf100 smp100 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...