./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_77a26699-7d21-4f91-916b-941c30e4d298/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_77a26699-7d21-4f91-916b-941c30e4d298/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_77a26699-7d21-4f91-916b-941c30e4d298/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_77a26699-7d21-4f91-916b-941c30e4d298/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_77a26699-7d21-4f91-916b-941c30e4d298/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_77a26699-7d21-4f91-916b-941c30e4d298/bin-2019/uautomizer --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.23-aa41828 [2018-11-22 22:24:05,447 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:24:05,448 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:24:05,454 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:24:05,454 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:24:05,455 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:24:05,456 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:24:05,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:24:05,458 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:24:05,458 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:24:05,459 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:24:05,459 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:24:05,460 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:24:05,460 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:24:05,461 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:24:05,462 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:24:05,462 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:24:05,463 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:24:05,464 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:24:05,466 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:24:05,466 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:24:05,467 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:24:05,469 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:24:05,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:24:05,469 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:24:05,469 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:24:05,470 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:24:05,470 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:24:05,471 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:24:05,471 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:24:05,472 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:24:05,472 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:24:05,472 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:24:05,472 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:24:05,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:24:05,474 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:24:05,474 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_77a26699-7d21-4f91-916b-941c30e4d298/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 22:24:05,481 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:24:05,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:24:05,482 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:24:05,482 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:24:05,482 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:24:05,483 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:24:05,483 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:24:05,483 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:24:05,483 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:24:05,483 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:24:05,483 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:24:05,483 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:24:05,483 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:24:05,484 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:24:05,484 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:24:05,484 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:24:05,484 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:24:05,484 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:24:05,484 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:24:05,484 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:24:05,485 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:24:05,485 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:24:05,485 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:24:05,485 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:24:05,485 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:24:05,485 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:24:05,485 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:24:05,486 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:24:05,486 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:24:05,486 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:24:05,486 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:24:05,487 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:24:05,487 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_77a26699-7d21-4f91-916b-941c30e4d298/bin-2019/uautomizer 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 [2018-11-22 22:24:05,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:24:05,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:24:05,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:24:05,522 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:24:05,522 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:24:05,522 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_77a26699-7d21-4f91-916b-941c30e4d298/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-22 22:24:05,562 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77a26699-7d21-4f91-916b-941c30e4d298/bin-2019/uautomizer/data/9f2c7f064/1707574338b54f0dae9ae84426667a97/FLAGe2763239f [2018-11-22 22:24:05,991 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:24:05,992 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_77a26699-7d21-4f91-916b-941c30e4d298/sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-22 22:24:05,998 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77a26699-7d21-4f91-916b-941c30e4d298/bin-2019/uautomizer/data/9f2c7f064/1707574338b54f0dae9ae84426667a97/FLAGe2763239f [2018-11-22 22:24:06,006 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_77a26699-7d21-4f91-916b-941c30e4d298/bin-2019/uautomizer/data/9f2c7f064/1707574338b54f0dae9ae84426667a97 [2018-11-22 22:24:06,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:24:06,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:24:06,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:24:06,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:24:06,013 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:24:06,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:24:06" (1/1) ... [2018-11-22 22:24:06,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693217b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:06, skipping insertion in model container [2018-11-22 22:24:06,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:24:06" (1/1) ... [2018-11-22 22:24:06,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:24:06,048 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:24:06,224 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:24:06,231 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:24:06,300 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:24:06,322 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:24:06,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:06 WrapperNode [2018-11-22 22:24:06,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:24:06,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:24:06,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:24:06,323 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:24:06,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:06" (1/1) ... [2018-11-22 22:24:06,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:06" (1/1) ... [2018-11-22 22:24:06,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:24:06,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:24:06,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:24:06,353 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:24:06,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:06" (1/1) ... [2018-11-22 22:24:06,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:06" (1/1) ... [2018-11-22 22:24:06,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:06" (1/1) ... [2018-11-22 22:24:06,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:06" (1/1) ... [2018-11-22 22:24:06,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:06" (1/1) ... [2018-11-22 22:24:06,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:06" (1/1) ... [2018-11-22 22:24:06,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:06" (1/1) ... [2018-11-22 22:24:06,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:24:06,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:24:06,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:24:06,368 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:24:06,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77a26699-7d21-4f91-916b-941c30e4d298/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:24:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:24:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:24:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:24:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:24:06,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:24:06,578 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:24:06,579 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-22 22:24:06,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:24:06 BoogieIcfgContainer [2018-11-22 22:24:06,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:24:06,579 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:24:06,579 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:24:06,583 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:24:06,583 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:24:06,584 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:24:06" (1/3) ... [2018-11-22 22:24:06,585 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f1ef3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:24:06, skipping insertion in model container [2018-11-22 22:24:06,585 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:24:06,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:24:06" (2/3) ... [2018-11-22 22:24:06,585 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f1ef3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:24:06, skipping insertion in model container [2018-11-22 22:24:06,585 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:24:06,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:24:06" (3/3) ... [2018-11-22 22:24:06,587 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-22 22:24:06,623 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:24:06,623 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:24:06,623 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:24:06,623 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:24:06,623 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:24:06,623 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:24:06,624 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:24:06,624 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:24:06,624 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:24:06,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-22 22:24:06,653 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-22 22:24:06,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:06,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:06,659 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:24:06,659 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:24:06,659 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:24:06,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-22 22:24:06,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-22 22:24:06,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:06,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:06,661 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:24:06,661 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:24:06,668 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.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~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 [2018-11-22 22:24:06,668 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~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset; 6#L546-2true [2018-11-22 22:24:06,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:06,674 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-22 22:24:06,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:06,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:06,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:06,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:06,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:06,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:06,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2018-11-22 22:24:06,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:06,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:06,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:06,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:06,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:06,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2018-11-22 22:24:06,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:06,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:06,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:06,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:06,940 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-22 22:24:07,183 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2018-11-22 22:24:07,272 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:24:07,272 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:24:07,273 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:24:07,273 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:24:07,273 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:24:07,273 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:07,273 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:24:07,273 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:24:07,273 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-22 22:24:07,273 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:24:07,278 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:24:07,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,494 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-11-22 22:24:07,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:07,953 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:24:07,957 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:24:07,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:07,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:07,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:07,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,966 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:24:07,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,970 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:24:07,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:07,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:07,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:08,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:08,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:08,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:08,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:08,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:08,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:08,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:08,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:08,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:08,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:08,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:08,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:08,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:08,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:08,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:08,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:08,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:08,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:08,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:08,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:08,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:08,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:08,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:08,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:08,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:08,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:08,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:08,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:08,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:08,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:08,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:08,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:08,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:08,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:08,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:08,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:08,036 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:24:08,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:08,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:08,038 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:24:08,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:08,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:08,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:08,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:08,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:08,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:08,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:08,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:08,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:08,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:08,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:08,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:08,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:08,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:08,056 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:24:08,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:08,056 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:24:08,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:08,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:08,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:08,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:08,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:08,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:08,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:08,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:08,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:08,134 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:24:08,158 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 22:24:08,158 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-22 22:24:08,160 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:24:08,161 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:24:08,161 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:24:08,162 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2018-11-22 22:24:08,190 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-22 22:24:08,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:08,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:08,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:24:08,279 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 [2018-11-22 22:24:08,280 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2018-11-22 22:24:08,312 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. [2018-11-22 22:24:08,313 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 [2018-11-22 22:24:08,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:24:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-22 22:24:08,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-22 22:24:08,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:08,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-22 22:24:08,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:08,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-22 22:24:08,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:08,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-11-22 22:24:08,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:24:08,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2018-11-22 22:24:08,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-22 22:24:08,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-22 22:24:08,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-22 22:24:08,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:24:08,323 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-22 22:24:08,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-22 22:24:08,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-22 22:24:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-22 22:24:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-22 22:24:08,340 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-22 22:24:08,340 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-22 22:24:08,340 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:24:08,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-22 22:24:08,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:24:08,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:08,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:08,341 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:24:08,341 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:24:08,342 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.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~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~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.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 [2018-11-22 22:24:08,342 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 [2018-11-22 22:24:08,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:08,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2018-11-22 22:24:08,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:08,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:08,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:08,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:08,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:08,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:08,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2018-11-22 22:24:08,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:08,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:08,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:08,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:08,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:08,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:08,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2018-11-22 22:24:08,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:08,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:08,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:08,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:08,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:08,674 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 121 [2018-11-22 22:24:08,777 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-22 22:24:08,778 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:24:08,779 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:24:08,779 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:24:08,779 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:24:08,779 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:24:08,779 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:08,779 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:24:08,779 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:24:08,779 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-22 22:24:08,779 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:24:08,779 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:24:08,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:08,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:08,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:08,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:08,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:08,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:08,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:08,975 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2018-11-22 22:24:09,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:09,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:09,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:09,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:09,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:09,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:09,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:09,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:09,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:09,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:09,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:09,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:09,338 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:24:09,338 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:24:09,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:09,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:09,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:09,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:09,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:09,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:09,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:09,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:09,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:09,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:09,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:09,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:09,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:09,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:09,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:09,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:09,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:09,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:09,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:09,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:09,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:09,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:09,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:09,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:09,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:09,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:09,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:09,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:09,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:09,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:09,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:09,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:09,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:09,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:09,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:09,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:09,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:09,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:09,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:09,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:09,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:09,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:09,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:09,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:09,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:09,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:09,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:09,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:09,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:09,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:09,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:09,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:09,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:09,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:09,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:09,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:09,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:09,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:09,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:09,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:09,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:09,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:09,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:09,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:09,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:09,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:09,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:09,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:09,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:09,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:09,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:09,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:09,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:09,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:09,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:09,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:09,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:09,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,385 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:24:09,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:09,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,387 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:24:09,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:09,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:09,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:09,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:09,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:09,394 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:24:09,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:09,401 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-22 22:24:09,401 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-22 22:24:09,475 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:24:09,522 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-22 22:24:09,522 INFO L444 ModelExtractionUtils]: 69 out of 76 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-22 22:24:09,522 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:24:09,524 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-22 22:24:09,524 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:24:09,524 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 [] [2018-11-22 22:24:09,553 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-22 22:24:09,557 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:24:09,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:09,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:09,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:24:09,608 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 [2018-11-22 22:24:09,608 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-22 22:24:09,643 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. [2018-11-22 22:24:09,644 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 [2018-11-22 22:24:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:24:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-22 22:24:09,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-22 22:24:09,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:09,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-22 22:24:09,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:09,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-22 22:24:09,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:09,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2018-11-22 22:24:09,646 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:24:09,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-11-22 22:24:09,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 22:24:09,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 22:24:09,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 22:24:09,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:24:09,647 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:24:09,647 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:24:09,647 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:24:09,647 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:24:09,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:24:09,647 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:24:09,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 22:24:09,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:24:09 BoogieIcfgContainer [2018-11-22 22:24:09,652 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:24:09,652 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:24:09,652 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:24:09,652 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:24:09,652 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:24:06" (3/4) ... [2018-11-22 22:24:09,655 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 22:24:09,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:24:09,655 INFO L168 Benchmark]: Toolchain (without parser) took 3646.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 193.5 MB). Free memory was 956.6 MB in the beginning and 926.5 MB in the end (delta: 30.1 MB). Peak memory consumption was 223.5 MB. Max. memory is 11.5 GB. [2018-11-22 22:24:09,656 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:24:09,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-22 22:24:09,657 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.59 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:24:09,657 INFO L168 Benchmark]: Boogie Preprocessor took 15.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:24:09,657 INFO L168 Benchmark]: RCFGBuilder took 211.04 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-22 22:24:09,658 INFO L168 Benchmark]: BuchiAutomizer took 3072.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 926.5 MB in the end (delta: 180.5 MB). Peak memory consumption was 232.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:24:09,658 INFO L168 Benchmark]: Witness Printer took 2.87 ms. Allocated memory is still 1.2 GB. Free memory is still 926.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:24:09,661 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 313.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.59 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.08 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 211.04 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3072.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 926.5 MB in the end (delta: 180.5 MB). Peak memory consumption was 232.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.87 ms. Allocated memory is still 1.2 GB. Free memory is still 926.5 MB. 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 3.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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, 26 SDslu, 14 SDs, 0 SdLazy, 9 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital224 mio100 ax100 hnf99 lsp97 ukn85 mio100 lsp48 div100 bol100 ite100 ukn100 eq202 hnf88 smp100 dnf116 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 131ms VariablesStem: 14 VariablesLoop: 9 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...