./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b075c0c6-2da4-41ad-bd47-01d8262650c2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b075c0c6-2da4-41ad-bd47-01d8262650c2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b075c0c6-2da4-41ad-bd47-01d8262650c2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b075c0c6-2da4-41ad-bd47-01d8262650c2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b075c0c6-2da4-41ad-bd47-01d8262650c2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b075c0c6-2da4-41ad-bd47-01d8262650c2/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 653582a7b000e4f324410c98077c6ee21baa5247 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 22:41:55,340 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:41:55,341 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:41:55,347 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:41:55,347 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:41:55,347 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:41:55,348 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:41:55,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:41:55,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:41:55,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:41:55,350 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:41:55,350 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:41:55,351 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:41:55,351 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:41:55,352 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:41:55,352 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:41:55,352 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:41:55,353 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:41:55,354 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:41:55,355 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:41:55,355 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:41:55,356 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:41:55,357 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:41:55,357 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:41:55,357 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:41:55,358 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:41:55,358 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:41:55,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:41:55,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:41:55,359 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:41:55,360 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:41:55,360 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:41:55,360 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:41:55,360 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:41:55,360 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:41:55,361 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:41:55,361 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b075c0c6-2da4-41ad-bd47-01d8262650c2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 22:41:55,369 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:41:55,369 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:41:55,369 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 22:41:55,369 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 22:41:55,370 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 22:41:55,370 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 22:41:55,370 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 22:41:55,370 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 22:41:55,370 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 22:41:55,370 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 22:41:55,370 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 22:41:55,370 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:41:55,370 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 22:41:55,370 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 22:41:55,370 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 22:41:55,371 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 22:41:55,371 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:41:55,371 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 22:41:55,371 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 22:41:55,371 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 22:41:55,371 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 22:41:55,371 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 22:41:55,371 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 22:41:55,371 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 22:41:55,371 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 22:41:55,371 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:41:55,371 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 22:41:55,372 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 22:41:55,372 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:41:55,372 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 22:41:55,372 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 22:41:55,372 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 22:41:55,372 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_b075c0c6-2da4-41ad-bd47-01d8262650c2/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 653582a7b000e4f324410c98077c6ee21baa5247 [2018-12-01 22:41:55,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:41:55,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:41:55,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:41:55,399 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:41:55,399 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:41:55,399 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b075c0c6-2da4-41ad-bd47-01d8262650c2/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-12-01 22:41:55,434 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b075c0c6-2da4-41ad-bd47-01d8262650c2/bin-2019/uautomizer/data/13628e374/6d4bfdf543f14942a21f80ac1e090c4b/FLAG984241ea0 [2018-12-01 22:41:55,871 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:41:55,871 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b075c0c6-2da4-41ad-bd47-01d8262650c2/sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-12-01 22:41:55,877 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b075c0c6-2da4-41ad-bd47-01d8262650c2/bin-2019/uautomizer/data/13628e374/6d4bfdf543f14942a21f80ac1e090c4b/FLAG984241ea0 [2018-12-01 22:41:55,886 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b075c0c6-2da4-41ad-bd47-01d8262650c2/bin-2019/uautomizer/data/13628e374/6d4bfdf543f14942a21f80ac1e090c4b [2018-12-01 22:41:55,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:41:55,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 22:41:55,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:41:55,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:41:55,891 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:41:55,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:41:55" (1/1) ... [2018-12-01 22:41:55,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7300e139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:55, skipping insertion in model container [2018-12-01 22:41:55,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:41:55" (1/1) ... [2018-12-01 22:41:55,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:41:55,916 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:41:56,054 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:41:56,061 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:41:56,122 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:41:56,146 INFO L195 MainTranslator]: Completed translation [2018-12-01 22:41:56,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:56 WrapperNode [2018-12-01 22:41:56,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 22:41:56,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 22:41:56,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 22:41:56,147 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 22:41:56,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:56" (1/1) ... [2018-12-01 22:41:56,159 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:56" (1/1) ... [2018-12-01 22:41:56,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 22:41:56,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 22:41:56,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 22:41:56,171 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 22:41:56,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:56" (1/1) ... [2018-12-01 22:41:56,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:56" (1/1) ... [2018-12-01 22:41:56,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:56" (1/1) ... [2018-12-01 22:41:56,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:56" (1/1) ... [2018-12-01 22:41:56,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:56" (1/1) ... [2018-12-01 22:41:56,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:56" (1/1) ... [2018-12-01 22:41:56,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:56" (1/1) ... [2018-12-01 22:41:56,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 22:41:56,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 22:41:56,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 22:41:56,185 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 22:41:56,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b075c0c6-2da4-41ad-bd47-01d8262650c2/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-12-01 22:41:56,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 22:41:56,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 22:41:56,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 22:41:56,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 22:41:56,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 22:41:56,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 22:41:56,330 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 22:41:56,330 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 22:41:56,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:41:56 BoogieIcfgContainer [2018-12-01 22:41:56,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 22:41:56,331 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 22:41:56,331 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 22:41:56,333 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 22:41:56,333 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 22:41:56,333 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 10:41:55" (1/3) ... [2018-12-01 22:41:56,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57824533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 10:41:56, skipping insertion in model container [2018-12-01 22:41:56,334 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 22:41:56,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:56" (2/3) ... [2018-12-01 22:41:56,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57824533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 10:41:56, skipping insertion in model container [2018-12-01 22:41:56,334 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 22:41:56,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:41:56" (3/3) ... [2018-12-01 22:41:56,335 INFO L375 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-12-01 22:41:56,367 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 22:41:56,368 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 22:41:56,368 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 22:41:56,368 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 22:41:56,368 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 22:41:56,368 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 22:41:56,368 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 22:41:56,368 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 22:41:56,368 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 22:41:56,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-01 22:41:56,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 22:41:56,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:41:56,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:41:56,392 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 22:41:56,393 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 22:41:56,393 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 22:41:56,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-01 22:41:56,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 22:41:56,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:41:56,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:41:56,394 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 22:41:56,394 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 22:41:56,398 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 4#L557true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 6#L557-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 10#L545-3true [2018-12-01 22:41:56,399 INFO L796 eck$LassoCheckResult]: Loop: 10#L545-3true assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 5#L548-3true assume !true; 7#L545-2true sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 10#L545-3true [2018-12-01 22:41:56,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:56,402 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-01 22:41:56,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:56,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:56,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:56,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:56,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:56,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:56,472 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2018-12-01 22:41:56,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:56,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:56,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:56,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:56,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:56,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:56,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 22:41:56,493 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 22:41:56,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-01 22:41:56,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-01 22:41:56,503 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-12-01 22:41:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:56,507 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-01 22:41:56,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 22:41:56,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-12-01 22:41:56,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 22:41:56,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2018-12-01 22:41:56,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-01 22:41:56,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-01 22:41:56,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-12-01 22:41:56,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 22:41:56,512 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-01 22:41:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-12-01 22:41:56,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-01 22:41:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-01 22:41:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-01 22:41:56,529 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-01 22:41:56,529 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-01 22:41:56,529 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 22:41:56,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-12-01 22:41:56,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 22:41:56,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:41:56,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:41:56,530 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 22:41:56,530 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 22:41:56,530 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 35#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 41#L557-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 36#L545-3 [2018-12-01 22:41:56,530 INFO L796 eck$LassoCheckResult]: Loop: 36#L545-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 37#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 39#L548-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 40#L545-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 36#L545-3 [2018-12-01 22:41:56,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:56,530 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-12-01 22:41:56,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:56,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:56,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:56,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:56,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:56,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:56,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2018-12-01 22:41:56,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:56,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:56,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:56,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:41:56,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:56,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:56,550 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2018-12-01 22:41:56,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:56,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:56,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:56,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:56,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:56,698 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:41:56,699 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:41:56,699 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:41:56,699 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:41:56,699 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:41:56,699 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:41:56,699 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:41:56,699 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:41:56,699 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-01 22:41:56,700 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:41:56,700 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:41:56,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:56,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:56,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:56,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:56,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:56,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:56,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:56,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:56,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:56,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:56,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:56,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:56,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:56,975 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:41:56,979 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:41:56,981 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-12-01 22:41:56,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:56,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:56,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:56,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:56,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:56,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:56,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:56,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:56,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:41:56,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:56,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:56,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:56,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:56,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:56,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:56,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:56,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:56,990 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-12-01 22:41:56,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:56,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:56,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:56,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:56,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:56,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:56,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:56,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:56,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:41:56,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:56,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:56,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:56,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:56,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:41:56,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:41:56,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:56,998 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-12-01 22:41:56,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:56,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:56,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:56,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:56,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:57,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:57,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:57,001 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-12-01 22:41:57,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:57,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:57,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:57,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:41:57,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:41:57,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:57,007 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-12-01 22:41:57,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:57,007 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 22:41:57,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:57,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,010 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 22:41:57,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:41:57,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:57,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:41:57,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:57,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:57,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:57,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:57,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:57,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:57,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:57,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:41:57,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:57,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:57,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:57,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:41:57,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:41:57,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:57,036 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-12-01 22:41:57,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:57,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:57,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:57,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:41:57,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:41:57,073 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:41:57,102 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-01 22:41:57,102 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-01 22:41:57,104 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:41:57,105 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 22:41:57,105 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:41:57,106 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 Supporting invariants [] [2018-12-01 22:41:57,109 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-01 22:41:57,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:57,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:57,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:57,161 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 22:41:57,162 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-01 22:41:57,185 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2018-12-01 22:41:57,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 22:41:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 22:41:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-01 22:41:57,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2018-12-01 22:41:57,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:41:57,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-01 22:41:57,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:41:57,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2018-12-01 22:41:57,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:41:57,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-12-01 22:41:57,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 22:41:57,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2018-12-01 22:41:57,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-01 22:41:57,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-01 22:41:57,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-12-01 22:41:57,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:41:57,190 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-01 22:41:57,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-12-01 22:41:57,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-12-01 22:41:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-01 22:41:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-12-01 22:41:57,191 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-12-01 22:41:57,191 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-12-01 22:41:57,191 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 22:41:57,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-12-01 22:41:57,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 22:41:57,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:41:57,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:41:57,192 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 22:41:57,192 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 22:41:57,192 INFO L794 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 103#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 104#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 113#L557-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 105#L545-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 107#L548-3 [2018-12-01 22:41:57,192 INFO L796 eck$LassoCheckResult]: Loop: 107#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 109#L548-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6; 107#L548-3 [2018-12-01 22:41:57,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:57,192 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-12-01 22:41:57,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:57,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:57,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:57,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:57,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:57,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:57,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-12-01 22:41:57,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:57,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:57,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:57,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:57,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:57,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:57,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-12-01 22:41:57,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:57,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:57,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:57,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:57,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:57,343 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:41:57,344 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:41:57,344 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:41:57,344 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:41:57,344 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:41:57,344 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:41:57,344 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:41:57,344 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:41:57,344 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-01 22:41:57,344 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:41:57,344 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:41:57,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,587 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:41:57,587 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:41:57,587 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-12-01 22:41:57,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:57,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:57,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:57,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:57,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:57,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:57,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:57,589 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-12-01 22:41:57,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:57,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:57,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:57,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:57,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:57,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:57,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:57,590 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-12-01 22:41:57,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:57,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:57,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:57,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:57,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:57,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:57,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:57,592 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-12-01 22:41:57,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:57,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:57,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:57,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:41:57,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:41:57,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:57,595 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-12-01 22:41:57,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:57,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:57,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:57,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:57,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:57,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:57,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:57,597 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-12-01 22:41:57,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:57,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:57,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:57,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:57,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:57,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:57,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:57,598 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-12-01 22:41:57,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:57,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:57,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:57,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:57,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:57,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:57,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:57,600 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-12-01 22:41:57,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:57,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:57,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:57,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:41:57,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:41:57,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:57,604 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-12-01 22:41:57,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:57,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:57,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:57,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:57,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:57,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:57,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:57,606 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-12-01 22:41:57,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:57,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:57,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:57,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:57,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:57,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:57,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:57,608 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:41:57,608 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 22:41:57,609 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 22:41:57,609 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:41:57,609 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 22:41:57,609 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:41:57,609 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2 Supporting invariants [] [2018-12-01 22:41:57,625 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-01 22:41:57,626 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 22:41:57,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:57,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:57,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:57,652 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 22:41:57,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-01 22:41:57,662 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 22 states and 29 transitions. Complement of second has 7 states. [2018-12-01 22:41:57,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 22:41:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 22:41:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-01 22:41:57,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-01 22:41:57,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:41:57,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-01 22:41:57,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:41:57,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-01 22:41:57,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:41:57,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2018-12-01 22:41:57,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 22:41:57,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 21 transitions. [2018-12-01 22:41:57,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-01 22:41:57,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-01 22:41:57,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2018-12-01 22:41:57,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:41:57,666 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-12-01 22:41:57,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2018-12-01 22:41:57,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-12-01 22:41:57,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-01 22:41:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-12-01 22:41:57,667 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-01 22:41:57,667 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-01 22:41:57,667 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 22:41:57,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-12-01 22:41:57,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 22:41:57,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:41:57,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:41:57,668 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:57,668 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 22:41:57,669 INFO L794 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 194#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 203#L557-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 195#L545-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 196#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 206#L548-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 205#L545-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 197#L545-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 199#L548-3 [2018-12-01 22:41:57,669 INFO L796 eck$LassoCheckResult]: Loop: 199#L548-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 201#L548-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6; 199#L548-3 [2018-12-01 22:41:57,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:57,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2018-12-01 22:41:57,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:57,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:57,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:57,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:57,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:57,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:57,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-12-01 22:41:57,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:57,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:57,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:57,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:41:57,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:57,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:57,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2018-12-01 22:41:57,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:57,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:57,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:57,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:41:57,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:57,849 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2018-12-01 22:41:57,881 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:41:57,881 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:41:57,881 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:41:57,881 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:41:57,881 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:41:57,881 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:41:57,881 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:41:57,881 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:41:57,881 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-12-01 22:41:57,881 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:41:57,881 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:41:57,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:57,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:41:58,110 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:41:58,110 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:41:58,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:41:58,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:58,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:58,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:58,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:58,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:58,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:58,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:58,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:58,112 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-12-01 22:41:58,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:58,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:58,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:58,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:58,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:41:58,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:41:58,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:58,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-12-01 22:41:58,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:58,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:58,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:58,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:58,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:58,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:58,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:58,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:58,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-12-01 22:41:58,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:58,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:58,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:58,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:58,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:41:58,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:41:58,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:58,123 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-12-01 22:41:58,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:58,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:58,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:58,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:58,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:58,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:58,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:58,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:58,125 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-12-01 22:41:58,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:58,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:58,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:58,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:58,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:58,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:58,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:58,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:58,126 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-12-01 22:41:58,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:58,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:58,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:58,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:58,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:58,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:58,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:58,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:58,128 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-12-01 22:41:58,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:58,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:58,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:58,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:58,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:41:58,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:41:58,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:58,133 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-12-01 22:41:58,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:58,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:58,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:58,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:58,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:41:58,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:41:58,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:41:58,142 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-12-01 22:41:58,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:41:58,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:41:58,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:41:58,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:41:58,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:41:58,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:41:58,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:41:58,144 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:41:58,145 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 22:41:58,145 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 22:41:58,145 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:41:58,145 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 22:41:58,145 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:41:58,146 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3 Supporting invariants [] [2018-12-01 22:41:58,160 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-12-01 22:41:58,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 22:41:58,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:58,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:58,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:58,198 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 22:41:58,198 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-01 22:41:58,208 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2018-12-01 22:41:58,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 22:41:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 22:41:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-01 22:41:58,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-01 22:41:58,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:41:58,209 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 22:41:58,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:58,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:58,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:58,240 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 22:41:58,240 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-01 22:41:58,246 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2018-12-01 22:41:58,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 22:41:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 22:41:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-01 22:41:58,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-01 22:41:58,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:41:58,247 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 22:41:58,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:58,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:58,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:58,271 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 22:41:58,271 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-01 22:41:58,279 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2018-12-01 22:41:58,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 22:41:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 22:41:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-01 22:41:58,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-01 22:41:58,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:41:58,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-01 22:41:58,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:41:58,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-01 22:41:58,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:41:58,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2018-12-01 22:41:58,282 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 22:41:58,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2018-12-01 22:41:58,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 22:41:58,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 22:41:58,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 22:41:58,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 22:41:58,283 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 22:41:58,283 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 22:41:58,283 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 22:41:58,283 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 22:41:58,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 22:41:58,283 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 22:41:58,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 22:41:58,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 10:41:58 BoogieIcfgContainer [2018-12-01 22:41:58,287 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 22:41:58,288 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 22:41:58,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 22:41:58,288 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 22:41:58,288 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:41:56" (3/4) ... [2018-12-01 22:41:58,291 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 22:41:58,291 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 22:41:58,291 INFO L168 Benchmark]: Toolchain (without parser) took 2403.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 225.4 MB). Free memory was 951.7 MB in the beginning and 1.0 GB in the end (delta: -85.7 MB). Peak memory consumption was 139.8 MB. Max. memory is 11.5 GB. [2018-12-01 22:41:58,292 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:41:58,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-01 22:41:58,293 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:41:58,293 INFO L168 Benchmark]: Boogie Preprocessor took 13.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:41:58,293 INFO L168 Benchmark]: RCFGBuilder took 145.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-12-01 22:41:58,293 INFO L168 Benchmark]: BuchiAutomizer took 1956.66 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 104.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.2 MB). Peak memory consumption was 152.1 MB. Max. memory is 11.5 GB. [2018-12-01 22:41:58,294 INFO L168 Benchmark]: Witness Printer took 3.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:41:58,296 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 145.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1956.66 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 104.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.2 MB). Peak memory consumption was 152.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 59 SDtfs, 44 SDslu, 10 SDs, 0 SdLazy, 32 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital131 mio100 ax100 hnf98 lsp90 ukn83 mio100 lsp59 div100 bol100 ite100 ukn100 eq188 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 4 VariablesLoop: 2 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...