./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a42c021ebd0de645918b065980a1f8d912cba85d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:19:22,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:19:22,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:19:22,208 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:19:22,209 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:19:22,210 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:19:22,211 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:19:22,213 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:19:22,215 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:19:22,216 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:19:22,217 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:19:22,217 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:19:22,218 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:19:22,219 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:19:22,221 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:19:22,222 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:19:22,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:19:22,226 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:19:22,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:19:22,236 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:19:22,237 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:19:22,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:19:22,244 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:19:22,245 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:19:22,245 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:19:22,246 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:19:22,250 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:19:22,250 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:19:22,251 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:19:22,254 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:19:22,255 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:19:22,256 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:19:22,256 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:19:22,256 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:19:22,258 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:19:22,260 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:19:22,261 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:19:22,289 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:19:22,290 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:19:22,291 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:19:22,294 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:19:22,295 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:19:22,295 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:19:22,295 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:19:22,295 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:19:22,295 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:19:22,296 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:19:22,296 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:19:22,296 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:19:22,296 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:19:22,296 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:19:22,296 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:19:22,298 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:19:22,298 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:19:22,298 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:19:22,298 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:19:22,299 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:19:22,299 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:19:22,299 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:19:22,299 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:19:22,299 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:19:22,299 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:19:22,300 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:19:22,302 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:19:22,302 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:19:22,302 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:19:22,302 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:19:22,303 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:19:22,304 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:19:22,305 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a42c021ebd0de645918b065980a1f8d912cba85d [2019-01-02 00:19:22,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:19:22,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:19:22,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:19:22,367 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:19:22,367 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:19:22,368 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:22,424 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c84884904/a7f55b3b8f254e2e99f3a228f11c28af/FLAG891176083 [2019-01-02 00:19:22,948 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:19:22,949 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:22,962 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c84884904/a7f55b3b8f254e2e99f3a228f11c28af/FLAG891176083 [2019-01-02 00:19:23,227 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c84884904/a7f55b3b8f254e2e99f3a228f11c28af [2019-01-02 00:19:23,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:19:23,232 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:19:23,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:19:23,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:19:23,238 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:19:23,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:19:23" (1/1) ... [2019-01-02 00:19:23,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c9951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:23, skipping insertion in model container [2019-01-02 00:19:23,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:19:23" (1/1) ... [2019-01-02 00:19:23,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:19:23,299 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:19:23,734 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:19:23,750 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:19:23,913 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:19:23,967 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:19:23,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:23 WrapperNode [2019-01-02 00:19:23,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:19:23,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:19:23,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:19:23,969 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:19:23,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:23" (1/1) ... [2019-01-02 00:19:23,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:23" (1/1) ... [2019-01-02 00:19:24,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:19:24,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:19:24,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:19:24,020 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:19:24,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:23" (1/1) ... [2019-01-02 00:19:24,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:23" (1/1) ... [2019-01-02 00:19:24,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:23" (1/1) ... [2019-01-02 00:19:24,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:23" (1/1) ... [2019-01-02 00:19:24,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:23" (1/1) ... [2019-01-02 00:19:24,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:23" (1/1) ... [2019-01-02 00:19:24,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:23" (1/1) ... [2019-01-02 00:19:24,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:19:24,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:19:24,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:19:24,063 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:19:24,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:24,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:19:24,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:19:24,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:19:24,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:19:24,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:19:24,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:19:24,534 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:19:24,535 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-02 00:19:24,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:24 BoogieIcfgContainer [2019-01-02 00:19:24,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:19:24,536 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:19:24,536 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:19:24,542 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:19:24,542 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:24,543 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:19:23" (1/3) ... [2019-01-02 00:19:24,544 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58079027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:19:24, skipping insertion in model container [2019-01-02 00:19:24,544 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:24,544 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:23" (2/3) ... [2019-01-02 00:19:24,544 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58079027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:19:24, skipping insertion in model container [2019-01-02 00:19:24,545 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:24,545 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:24" (3/3) ... [2019-01-02 00:19:24,546 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:24,608 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:19:24,608 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:19:24,609 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:19:24,609 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:19:24,609 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:19:24,609 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:19:24,609 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:19:24,609 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:19:24,610 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:19:24,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-02 00:19:24,649 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:19:24,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:24,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:24,656 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:19:24,656 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:19:24,656 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:19:24,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-02 00:19:24,658 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:19:24,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:24,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:24,659 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:19:24,659 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:19:24,667 INFO L794 eck$LassoCheckResult]: Stem: 9#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; 12#L561true assume !(main_~length~0 < 1); 16#L561-2true assume !(main_~n~0 < 1); 10#L564-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(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.allocOnStack(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~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.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~post2, 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~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 6#L546-2true [2019-01-02 00:19:24,667 INFO L796 eck$LassoCheckResult]: Loop: 6#L546-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~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); 3#L548true 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; 6#L546-2true [2019-01-02 00:19:24,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:24,673 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-02 00:19:24,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:24,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:24,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:24,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:24,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:24,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:24,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2019-01-02 00:19:24,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:24,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:24,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:24,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:24,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:24,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:24,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2019-01-02 00:19:24,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:24,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:24,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:24,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:24,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:25,200 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-02 00:19:25,451 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-02 00:19:26,331 WARN L181 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-01-02 00:19:26,545 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-01-02 00:19:26,558 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:26,559 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:26,559 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:26,559 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:26,560 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:26,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:26,560 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:26,560 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:26,560 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-02 00:19:26,560 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:26,561 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:26,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:26,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:26,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:26,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:26,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:26,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:26,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:26,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:26,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:27,213 WARN L181 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-01-02 00:19:27,480 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-01-02 00:19:27,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:27,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:27,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:27,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:27,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:27,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:27,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:27,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:27,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:27,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:27,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:27,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:27,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:27,826 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-02 00:19:28,184 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-02 00:19:28,756 WARN L181 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-02 00:19:28,807 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:28,812 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:28,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:28,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:28,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:28,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:28,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:28,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:28,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:28,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:28,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:28,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:28,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:28,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:28,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:28,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:28,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:28,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:28,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:28,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:28,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:28,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:28,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:28,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:28,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:28,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:28,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:28,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:28,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:28,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:28,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:28,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:28,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:28,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:28,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:28,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:28,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:28,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:28,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:28,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:28,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:28,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:28,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:28,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:28,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:28,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:28,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:28,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:28,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:28,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:28,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:28,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:28,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:28,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:28,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:28,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:28,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:28,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:28,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:28,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:28,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:28,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:28,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:28,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:28,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:28,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:28,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:28,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:28,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:28,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:28,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:28,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:28,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:28,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:28,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:28,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:28,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:28,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:28,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:28,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:28,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:28,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:28,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:28,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:28,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:28,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:28,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:28,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:28,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:28,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:28,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:28,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:28,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:28,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:28,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:28,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:28,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:28,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:28,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:28,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:28,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:28,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:28,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:28,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:28,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:28,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:28,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:28,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:28,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:28,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:28,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:28,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:28,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:28,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:28,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:28,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:28,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:28,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:28,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:28,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:28,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:29,093 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:29,164 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-02 00:19:29,164 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-02 00:19:29,167 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:29,169 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:19:29,171 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:29,172 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2019-01-02 00:19:29,322 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-01-02 00:19:29,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:29,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:29,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:29,558 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:19:29,559 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-01-02 00:19:29,608 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 5 states. [2019-01-02 00:19:29,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:19:29,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:19:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-02 00:19:29,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-02 00:19:29,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:29,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-02 00:19:29,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:29,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-02 00:19:29,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:29,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-01-02 00:19:29,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:19:29,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2019-01-02 00:19:29,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-02 00:19:29,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-02 00:19:29,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-02 00:19:29,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:19:29,635 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-02 00:19:29,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-02 00:19:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-02 00:19:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-02 00:19:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-02 00:19:29,660 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-02 00:19:29,660 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-02 00:19:29,660 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:19:29,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-02 00:19:29,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:19:29,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:29,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:29,662 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:29,662 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:19:29,662 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#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; 145#L561 assume !(main_~length~0 < 1); 150#L561-2 assume !(main_~n~0 < 1); 148#L564-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(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.allocOnStack(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~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.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~post2, 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~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 149#L546-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~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); 141#L548 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;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 143#L551-3 [2019-01-02 00:19:29,662 INFO L796 eck$LassoCheckResult]: Loop: 143#L551-3 cstrncpy_#t~post6 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post6 - 1; 146#L551-1 assume !!(0 != cstrncpy_#t~post6);havoc cstrncpy_#t~post6;cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~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; 143#L551-3 [2019-01-02 00:19:29,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:29,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2019-01-02 00:19:29,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:29,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:29,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:29,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:29,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-01-02 00:19:29,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:29,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:29,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:29,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:29,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2019-01-02 00:19:29,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:29,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:29,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:29,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,987 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-02 00:19:30,181 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-02 00:19:30,795 WARN L181 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 128 [2019-01-02 00:19:30,972 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-01-02 00:19:30,976 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:30,976 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:30,976 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:30,976 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:30,977 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:30,977 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:30,977 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:30,977 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:30,977 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-02 00:19:30,977 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:30,977 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:30,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:30,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:30,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:30,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,534 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-01-02 00:19:32,030 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-02 00:19:33,105 WARN L181 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-02 00:19:33,129 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:33,130 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:33,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:33,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:33,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:33,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:33,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:33,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:33,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:33,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:33,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:33,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:33,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:33,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:33,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,269 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:19:33,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,280 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-02 00:19:33,281 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-02 00:19:33,440 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:33,511 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-02 00:19:33,511 INFO L444 ModelExtractionUtils]: 73 out of 81 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-02 00:19:33,512 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:33,515 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-02 00:19:33,515 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:33,515 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2) = -1*ULTIMATE.start_cstrncpy_~us~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 Supporting invariants [] [2019-01-02 00:19:33,875 INFO L297 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2019-01-02 00:19:33,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:19:33,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:33,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:33,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:33,973 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-02 00:19:33,973 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-02 00:19:34,228 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2019-01-02 00:19:34,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:19:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:19:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-02 00:19:34,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-02 00:19:34,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:34,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-02 00:19:34,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:34,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-02 00:19:34,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:34,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2019-01-02 00:19:34,233 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:19:34,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-01-02 00:19:34,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:19:34,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:19:34,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:19:34,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:19:34,234 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:34,234 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:34,234 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:34,234 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:19:34,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:19:34,234 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:19:34,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:19:34,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:19:34 BoogieIcfgContainer [2019-01-02 00:19:34,241 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:19:34,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:19:34,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:19:34,242 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:19:34,242 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:24" (3/4) ... [2019-01-02 00:19:34,245 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:19:34,245 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:19:34,246 INFO L168 Benchmark]: Toolchain (without parser) took 11014.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 298.3 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -91.7 MB). Peak memory consumption was 206.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:34,247 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:34,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -156.0 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:34,248 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:34,249 INFO L168 Benchmark]: Boogie Preprocessor took 42.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:34,249 INFO L168 Benchmark]: RCFGBuilder took 473.12 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.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:34,250 INFO L168 Benchmark]: BuchiAutomizer took 9705.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 221.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:34,251 INFO L168 Benchmark]: Witness Printer took 3.65 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:34,255 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 735.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -156.0 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.49 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. * Boogie Preprocessor took 42.66 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 473.12 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.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9705.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 221.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.65 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 n and consists of 4 locations. One deterministic module has affine ranking function -1 * us + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 8.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. 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 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 24 SDslu, 14 SDs, 0 SdLazy, 9 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital239 mio100 ax100 hnf99 lsp97 ukn84 mio100 lsp48 div100 bol100 ite100 ukn100 eq202 hnf88 smp100 dnf174 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 248ms VariablesStem: 15 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...