./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_38848795-125b-4521-857b-d5a1ceee5caa/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_38848795-125b-4521-857b-d5a1ceee5caa/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_38848795-125b-4521-857b-d5a1ceee5caa/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_38848795-125b-4521-857b-d5a1ceee5caa/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_38848795-125b-4521-857b-d5a1ceee5caa/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_38848795-125b-4521-857b-d5a1ceee5caa/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 64bit --witnessprinter.graph.data.programhash 6d213bb73df5e8110170d83073afe858aea401c0 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:10:55,982 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:10:55,983 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:10:55,997 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:10:55,998 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:10:55,998 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:10:55,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:10:56,000 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:10:56,006 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:10:56,007 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:10:56,008 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:10:56,008 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:10:56,008 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:10:56,009 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:10:56,019 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:10:56,020 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:10:56,021 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:10:56,022 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:10:56,023 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:10:56,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:10:56,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:10:56,029 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:10:56,033 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:10:56,033 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:10:56,034 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:10:56,034 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:10:56,035 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:10:56,036 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:10:56,036 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:10:56,037 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:10:56,037 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:10:56,040 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:10:56,040 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:10:56,040 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:10:56,041 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:10:56,041 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:10:56,041 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_38848795-125b-4521-857b-d5a1ceee5caa/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:10:56,059 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:10:56,060 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:10:56,062 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:10:56,062 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:10:56,063 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:10:56,063 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:10:56,063 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:10:56,063 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:10:56,063 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:10:56,063 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:10:56,064 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:10:56,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:10:56,064 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:10:56,064 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:10:56,064 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:10:56,064 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:10:56,064 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:10:56,065 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:10:56,065 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:10:56,065 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:10:56,065 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:10:56,065 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:10:56,069 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:10:56,070 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:10:56,070 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:10:56,070 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:10:56,070 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:10:56,071 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:10:56,071 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_38848795-125b-4521-857b-d5a1ceee5caa/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d213bb73df5e8110170d83073afe858aea401c0 [2018-10-27 06:10:56,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:10:56,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:10:56,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:10:56,112 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:10:56,113 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:10:56,114 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_38848795-125b-4521-857b-d5a1ceee5caa/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i [2018-10-27 06:10:56,165 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38848795-125b-4521-857b-d5a1ceee5caa/bin-2019/uautomizer/data/38bf08a28/4e40b9eb29ea43f19e65c296484cef1c/FLAG0960b4108 [2018-10-27 06:10:56,583 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:10:56,587 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_38848795-125b-4521-857b-d5a1ceee5caa/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i [2018-10-27 06:10:56,596 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38848795-125b-4521-857b-d5a1ceee5caa/bin-2019/uautomizer/data/38bf08a28/4e40b9eb29ea43f19e65c296484cef1c/FLAG0960b4108 [2018-10-27 06:10:56,610 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_38848795-125b-4521-857b-d5a1ceee5caa/bin-2019/uautomizer/data/38bf08a28/4e40b9eb29ea43f19e65c296484cef1c [2018-10-27 06:10:56,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:10:56,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:10:56,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:56,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:10:56,623 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:10:56,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:56" (1/1) ... [2018-10-27 06:10:56,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d51faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:56, skipping insertion in model container [2018-10-27 06:10:56,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:56" (1/1) ... [2018-10-27 06:10:56,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:10:56,670 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:10:56,914 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:56,924 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:10:56,984 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:57,019 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:10:57,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:57 WrapperNode [2018-10-27 06:10:57,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:57,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:57,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:10:57,021 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:10:57,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:57" (1/1) ... [2018-10-27 06:10:57,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:57" (1/1) ... [2018-10-27 06:10:57,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:57,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:10:57,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:10:57,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:10:57,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:57" (1/1) ... [2018-10-27 06:10:57,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:57" (1/1) ... [2018-10-27 06:10:57,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:57" (1/1) ... [2018-10-27 06:10:57,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:57" (1/1) ... [2018-10-27 06:10:57,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:57" (1/1) ... [2018-10-27 06:10:57,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:57" (1/1) ... [2018-10-27 06:10:57,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:57" (1/1) ... [2018-10-27 06:10:57,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:10:57,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:10:57,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:10:57,155 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:10:57,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38848795-125b-4521-857b-d5a1ceee5caa/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-10-27 06:10:57,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:10:57,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:10:57,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:10:57,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:10:57,767 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:10:57,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:57 BoogieIcfgContainer [2018-10-27 06:10:57,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:10:57,768 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:10:57,768 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:10:57,771 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:10:57,772 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:57,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:10:56" (1/3) ... [2018-10-27 06:10:57,773 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ec3fcf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:57, skipping insertion in model container [2018-10-27 06:10:57,773 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:57,773 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:57" (2/3) ... [2018-10-27 06:10:57,774 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ec3fcf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:57, skipping insertion in model container [2018-10-27 06:10:57,774 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:57,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:57" (3/3) ... [2018-10-27 06:10:57,775 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-termination.c.i [2018-10-27 06:10:57,833 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:10:57,834 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:10:57,834 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:10:57,834 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:10:57,834 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:10:57,834 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:10:57,835 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:10:57,835 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:10:57,835 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:10:57,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-10-27 06:10:57,880 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:10:57,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:57,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:57,889 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:57,890 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:57,890 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:10:57,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-10-27 06:10:57,893 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:10:57,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:57,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:57,895 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:57,896 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:10:57,904 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 15#L570true assume !(main_~length~0 < 1); 4#L570-2true assume !(main_~n~1 < 1); 26#L573-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~1 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 18#L578true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1) * 1, 1); srcloc: L578 19#L578-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L578-1 3#L579true assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 21#L553true assume cstrlcpy_~n~0 % 4294967296 != 0; 12#L554-4true [2018-10-27 06:10:57,907 INFO L795 eck$LassoCheckResult]: Loop: 12#L554-4true assume true; 8#L554-1true cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 9#L554-2true assume !!(cstrlcpy_#t~pre2 % 4294967296 != 0);havoc cstrlcpy_#t~pre2;cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset := cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset + 1;cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset + 1; 5#L555true SUMMARY for call cstrlcpy_#t~mem5 := read~int(cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, 1); srcloc: L555 6#L555-1true SUMMARY for call write~int(cstrlcpy_#t~mem5, cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, 1); srcloc: L555-1 22#L555-2true assume !(cstrlcpy_#t~mem5 == 0);havoc cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset;havoc cstrlcpy_#t~mem5; 12#L554-4true [2018-10-27 06:10:57,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:57,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1298223690, now seen corresponding path program 1 times [2018-10-27 06:10:57,916 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:57,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:57,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:57,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:57,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:58,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:58,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1629153641, now seen corresponding path program 1 times [2018-10-27 06:10:58,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:58,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:58,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:58,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:58,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:58,105 INFO L82 PathProgramCache]: Analyzing trace with hash 912105714, now seen corresponding path program 1 times [2018-10-27 06:10:58,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:58,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:58,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:58,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:58,388 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-27 06:10:59,392 WARN L179 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2018-10-27 06:10:59,561 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-10-27 06:10:59,570 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:59,571 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:59,572 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:59,572 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:59,572 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:59,572 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:59,572 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:59,572 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:59,573 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:10:59,573 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:59,573 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:59,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-10-27 06:10:59,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,098 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 105 [2018-10-27 06:11:00,290 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2018-10-27 06:11:00,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,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-10-27 06:11:00,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:00,804 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2018-10-27 06:11:00,954 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-10-27 06:11:01,304 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:01,308 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:01,310 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-10-27 06:11:01,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:01,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:01,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:01,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:01,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:01,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:01,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:01,316 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:01,316 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-10-27 06:11:01,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:01,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:01,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:01,317 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:11:01,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:01,318 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:11:01,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:01,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:01,322 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-10-27 06:11:01,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:01,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:01,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:01,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:01,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:01,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:01,365 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:01,366 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-10-27 06:11:01,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:01,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:01,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:01,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:01,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:01,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:01,374 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:01,375 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-10-27 06:11:01,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:01,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:01,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:01,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:01,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:01,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:01,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:01,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:01,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-10-27 06:11:01,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:01,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:01,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:01,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:01,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:01,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:01,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:01,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-10-27 06:11:01,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:01,404 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:01,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:01,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:01,408 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:01,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:01,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:01,437 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-10-27 06:11:01,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:01,438 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:01,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:01,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:01,440 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:01,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:01,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:01,455 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-10-27 06:11:01,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:01,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:01,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:01,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:01,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:01,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:01,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:01,460 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-10-27 06:11:01,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:01,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:01,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:01,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:01,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:01,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:01,574 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:01,654 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:11:01,655 INFO L444 ModelExtractionUtils]: 57 out of 67 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-10-27 06:11:01,657 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:01,659 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:01,659 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:01,660 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1, ULTIMATE.start_cstrlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 - 1*ULTIMATE.start_cstrlcpy_~s~0.offset Supporting invariants [] [2018-10-27 06:11:01,764 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2018-10-27 06:11:01,772 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:01,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:01,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:01,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:01,964 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-10-27 06:11:01,966 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 7 states. [2018-10-27 06:11:02,247 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 7 states. Result 75 states and 97 transitions. Complement of second has 10 states. [2018-10-27 06:11:02,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:11:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-10-27 06:11:02,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 66 transitions. Stem has 9 letters. Loop has 6 letters. [2018-10-27 06:11:02,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:02,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 66 transitions. Stem has 15 letters. Loop has 6 letters. [2018-10-27 06:11:02,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:02,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 66 transitions. Stem has 9 letters. Loop has 12 letters. [2018-10-27 06:11:02,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:02,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 97 transitions. [2018-10-27 06:11:02,263 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-10-27 06:11:02,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 39 states and 47 transitions. [2018-10-27 06:11:02,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-10-27 06:11:02,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-10-27 06:11:02,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2018-10-27 06:11:02,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:02,271 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-10-27 06:11:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2018-10-27 06:11:02,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-27 06:11:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 06:11:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-10-27 06:11:02,299 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-10-27 06:11:02,299 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-10-27 06:11:02,299 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:11:02,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-10-27 06:11:02,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:11:02,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:02,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:02,300 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:02,301 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:11:02,301 INFO L793 eck$LassoCheckResult]: Stem: 273#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 263#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 264#L570 assume !(main_~length~0 < 1); 256#L570-2 assume !(main_~n~1 < 1); 257#L573-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~1 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 258#L578 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1) * 1, 1); srcloc: L578 259#L578-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L578-1 254#L579 assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 255#L553 assume !(cstrlcpy_~n~0 % 4294967296 != 0); 265#L553-1 assume cstrlcpy_~n~0 % 4294967296 == 0; 274#L560 assume !(cstrlcpy_~siz % 4294967296 != 0); 252#L562-4 [2018-10-27 06:11:02,301 INFO L795 eck$LassoCheckResult]: Loop: 252#L562-4 assume true; 253#L562 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset + 1; 275#L562-1 SUMMARY for call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); srcloc: L562-1 277#L562-2 assume !!(cstrlcpy_#t~mem7 != 0);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 252#L562-4 [2018-10-27 06:11:02,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:02,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2052473895, now seen corresponding path program 1 times [2018-10-27 06:11:02,306 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:02,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:02,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:02,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:02,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2711016, now seen corresponding path program 1 times [2018-10-27 06:11:02,334 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:02,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:02,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash 534060814, now seen corresponding path program 1 times [2018-10-27 06:11:02,349 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:02,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:02,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:02,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:02,661 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 105 [2018-10-27 06:11:02,830 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-10-27 06:11:02,835 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:02,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:02,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:02,836 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:02,836 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:02,836 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:02,836 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:02,836 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:02,836 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:11:02,836 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:02,836 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:02,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:02,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:02,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:02,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:02,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:02,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:02,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:02,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:02,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:02,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:02,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:02,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:03,154 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2018-10-27 06:11:03,299 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-10-27 06:11:03,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:03,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:03,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:03,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:03,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:03,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:03,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:03,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:03,863 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:03,863 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:03,863 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-10-27 06:11:03,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:03,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:03,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:03,868 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,869 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-10-27 06:11:03,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:03,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:03,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:03,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,871 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-10-27 06:11:03,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:03,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:03,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:03,872 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,872 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-10-27 06:11:03,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:03,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:03,882 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,883 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-10-27 06:11:03,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:03,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:03,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:03,885 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,885 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-10-27 06:11:03,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:03,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:03,895 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,896 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-10-27 06:11:03,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:03,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:03,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:03,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,898 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-10-27 06:11:03,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:03,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:03,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:03,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,905 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-10-27 06:11:03,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:03,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:03,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:03,907 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,907 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-10-27 06:11:03,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:03,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:03,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,916 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-10-27 06:11:03,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:03,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:03,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:03,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,919 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-10-27 06:11:03,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:03,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:03,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,922 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-10-27 06:11:03,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:03,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:03,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,927 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-10-27 06:11:03,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:03,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:03,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,931 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-10-27 06:11:03,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:03,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:03,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,935 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-10-27 06:11:03,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:03,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:03,947 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,948 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-10-27 06:11:03,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:03,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:03,957 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,958 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-10-27 06:11:03,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,958 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:03,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,960 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:03,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:03,972 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:03,972 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-10-27 06:11:03,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:03,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:03,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:03,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:03,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:03,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:03,990 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:04,000 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:11:04,000 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:11:04,001 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:04,002 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:04,003 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:04,003 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrlcpy_~s~0.offset Supporting invariants [] [2018-10-27 06:11:04,246 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:11:04,264 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:11:04,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:04,265 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:11:04,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:04,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:04,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:04,600 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-10-27 06:11:04,600 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-10-27 06:11:04,683 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 35 states and 43 transitions. Complement of second has 8 states. [2018-10-27 06:11:04,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:11:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-10-27 06:11:04,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 11 letters. Loop has 4 letters. [2018-10-27 06:11:04,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:04,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 15 letters. Loop has 4 letters. [2018-10-27 06:11:04,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:04,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 11 letters. Loop has 8 letters. [2018-10-27 06:11:04,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:04,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2018-10-27 06:11:04,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:11:04,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 26 states and 32 transitions. [2018-10-27 06:11:04,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:11:04,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:11:04,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-10-27 06:11:04,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:04,689 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-10-27 06:11:04,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-10-27 06:11:04,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-27 06:11:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 06:11:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-10-27 06:11:04,694 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-10-27 06:11:04,695 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-10-27 06:11:04,695 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:11:04,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-10-27 06:11:04,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:11:04,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:04,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:04,698 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:04,698 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:11:04,698 INFO L793 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 440#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 441#L570 assume !(main_~length~0 < 1); 433#L570-2 assume !(main_~n~1 < 1); 434#L573-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~1 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 435#L578 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1) * 1, 1); srcloc: L578 436#L578-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L578-1 431#L579 assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 432#L553 assume !(cstrlcpy_~n~0 % 4294967296 != 0); 443#L553-1 assume cstrlcpy_~n~0 % 4294967296 == 0; 451#L560 assume cstrlcpy_~siz % 4294967296 != 0; 453#L561 SUMMARY for call write~int(0, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, 1); srcloc: L561 429#L562-4 [2018-10-27 06:11:04,699 INFO L795 eck$LassoCheckResult]: Loop: 429#L562-4 assume true; 430#L562 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset + 1; 452#L562-1 SUMMARY for call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); srcloc: L562-1 454#L562-2 assume !!(cstrlcpy_#t~mem7 != 0);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 429#L562-4 [2018-10-27 06:11:04,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:04,699 INFO L82 PathProgramCache]: Analyzing trace with hash -797818736, now seen corresponding path program 1 times [2018-10-27 06:11:04,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:04,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:04,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:04,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:04,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:04,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:04,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:11:04,924 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:04,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:04,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2711016, now seen corresponding path program 2 times [2018-10-27 06:11:04,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:04,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:04,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:04,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:11:05,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:11:05,056 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-10-27 06:11:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:05,094 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-10-27 06:11:05,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:11:05,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-10-27 06:11:05,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:11:05,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 33 transitions. [2018-10-27 06:11:05,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-10-27 06:11:05,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:11:05,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2018-10-27 06:11:05,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:05,098 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-10-27 06:11:05,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2018-10-27 06:11:05,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-10-27 06:11:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 06:11:05,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-10-27 06:11:05,100 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-10-27 06:11:05,100 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-10-27 06:11:05,100 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:11:05,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-10-27 06:11:05,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:11:05,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:05,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:05,101 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:05,101 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:11:05,105 INFO L793 eck$LassoCheckResult]: Stem: 515#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 506#L570 assume !(main_~length~0 < 1); 498#L570-2 assume !(main_~n~1 < 1); 499#L573-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~1 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 500#L578 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1) * 1, 1); srcloc: L578 501#L578-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L578-1 496#L579 assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 497#L553 assume cstrlcpy_~n~0 % 4294967296 != 0; 507#L554-4 assume true; 508#L554-1 cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 509#L554-2 assume !(cstrlcpy_#t~pre2 % 4294967296 != 0);havoc cstrlcpy_#t~pre2; 512#L553-1 assume cstrlcpy_~n~0 % 4294967296 == 0; 516#L560 assume cstrlcpy_~siz % 4294967296 != 0; 518#L561 SUMMARY for call write~int(0, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, 1); srcloc: L561 494#L562-4 [2018-10-27 06:11:05,106 INFO L795 eck$LassoCheckResult]: Loop: 494#L562-4 assume true; 495#L562 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset + 1; 517#L562-1 SUMMARY for call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); srcloc: L562-1 519#L562-2 assume !!(cstrlcpy_#t~mem7 != 0);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 494#L562-4 [2018-10-27 06:11:05,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:05,106 INFO L82 PathProgramCache]: Analyzing trace with hash 912061087, now seen corresponding path program 1 times [2018-10-27 06:11:05,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:05,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:05,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2711016, now seen corresponding path program 3 times [2018-10-27 06:11:05,128 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:05,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:05,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:05,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:05,135 INFO L82 PathProgramCache]: Analyzing trace with hash 57659782, now seen corresponding path program 1 times [2018-10-27 06:11:05,135 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:05,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:05,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:05,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,644 WARN L179 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 119 [2018-10-27 06:11:05,832 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-10-27 06:11:05,834 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:05,834 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:05,835 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:05,835 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:05,835 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:05,835 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:05,835 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:05,835 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:05,835 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-termination.c.i_Iteration4_Lasso [2018-10-27 06:11:05,835 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:05,835 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:05,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:05,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:05,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:05,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:05,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:05,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,234 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 105 [2018-10-27 06:11:06,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:06,699 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2018-10-27 06:11:07,100 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:07,100 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:07,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:07,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:07,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:07,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:07,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:07,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:07,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:07,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:07,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:07,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:07,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:07,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:07,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:07,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:07,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:07,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:07,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:07,113 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-10-27 06:11:07,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:07,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:07,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:07,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:07,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:07,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:07,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:07,115 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:07,115 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-10-27 06:11:07,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:07,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:07,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:07,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:07,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:07,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:07,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:07,117 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:07,117 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-10-27 06:11:07,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:07,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:07,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:07,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:07,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:07,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:07,129 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:07,129 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-10-27 06:11:07,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:07,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:07,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:07,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:07,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:07,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:07,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:07,131 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:07,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:07,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:07,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:07,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:07,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:07,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:07,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:07,135 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:07,135 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-10-27 06:11:07,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:07,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:07,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:07,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:07,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:07,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:07,149 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:07,150 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-10-27 06:11:07,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:07,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:07,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:07,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:07,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:07,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:07,153 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:07,153 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-10-27 06:11:07,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:07,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:07,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:07,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:07,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:07,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:07,156 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:07,157 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-10-27 06:11:07,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:07,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:07,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:07,158 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:11:07,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:07,158 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:11:07,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:07,159 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:07,160 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-10-27 06:11:07,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:07,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:07,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:07,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:07,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:07,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:07,177 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:07,178 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-10-27 06:11:07,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:07,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:07,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:07,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:07,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:07,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:07,213 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:07,229 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:11:07,230 INFO L444 ModelExtractionUtils]: 59 out of 64 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:11:07,230 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:07,231 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:07,231 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:07,231 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_cstrlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_cstrlcpy_~s~0.offset Supporting invariants [] [2018-10-27 06:11:07,638 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-10-27 06:11:07,642 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:11:07,642 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:07,643 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:11:07,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:07,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:07,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:07,740 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-10-27 06:11:07,740 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-10-27 06:11:07,834 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 31 states and 37 transitions. Complement of second has 8 states. [2018-10-27 06:11:07,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:11:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-10-27 06:11:07,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 15 letters. Loop has 4 letters. [2018-10-27 06:11:07,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:07,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 19 letters. Loop has 4 letters. [2018-10-27 06:11:07,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:07,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 15 letters. Loop has 8 letters. [2018-10-27 06:11:07,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:07,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2018-10-27 06:11:07,838 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:07,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-10-27 06:11:07,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:11:07,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:11:07,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:11:07,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:07,838 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:07,838 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:07,839 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:07,839 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:11:07,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:11:07,839 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:07,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:11:07,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:11:07 BoogieIcfgContainer [2018-10-27 06:11:07,847 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:11:07,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:11:07,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:11:07,848 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:11:07,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:57" (3/4) ... [2018-10-27 06:11:07,852 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:11:07,852 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:11:07,853 INFO L168 Benchmark]: Toolchain (without parser) took 11239.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 955.4 MB in the beginning and 873.5 MB in the end (delta: 81.9 MB). Peak memory consumption was 300.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:07,856 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:07,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.44 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 933.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:07,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -207.3 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:07,860 INFO L168 Benchmark]: Boogie Preprocessor took 26.99 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-10-27 06:11:07,860 INFO L168 Benchmark]: RCFGBuilder took 612.99 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:07,861 INFO L168 Benchmark]: BuchiAutomizer took 10079.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 880.0 MB in the end (delta: 230.8 MB). Peak memory consumption was 305.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:07,861 INFO L168 Benchmark]: Witness Printer took 4.72 ms. Allocated memory is still 1.2 GB. Free memory was 880.0 MB in the beginning and 873.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:07,865 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.44 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 933.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -207.3 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.99 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. * RCFGBuilder took 612.99 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10079.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 880.0 MB in the end (delta: 230.8 MB). Peak memory consumption was 305.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.72 ms. Allocated memory is still 1.2 GB. Free memory was 880.0 MB in the beginning and 873.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] + -1 * s and consists of 7 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 8.7s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 131 SDslu, 109 SDs, 0 SdLazy, 69 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital243 mio100 ax107 hnf99 lsp90 ukn97 mio100 lsp40 div152 bol100 ite100 ukn100 eq178 hnf70 smp94 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms VariablesStem: 6 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...