./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_04ddb564-7802-49bc-bf44-3d370f30d52b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_04ddb564-7802-49bc-bf44-3d370f30d52b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_04ddb564-7802-49bc-bf44-3d370f30d52b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_04ddb564-7802-49bc-bf44-3d370f30d52b/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_04ddb564-7802-49bc-bf44-3d370f30d52b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_04ddb564-7802-49bc-bf44-3d370f30d52b/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-1dbac8b [2018-11-10 05:33:50,810 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:33:50,812 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:33:50,820 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:33:50,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:33:50,821 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:33:50,822 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:33:50,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:33:50,825 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:33:50,825 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:33:50,826 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:33:50,826 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:33:50,827 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:33:50,828 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:33:50,829 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:33:50,830 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:33:50,830 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:33:50,832 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:33:50,833 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:33:50,835 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:33:50,836 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:33:50,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:33:50,839 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:33:50,839 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:33:50,839 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:33:50,840 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:33:50,841 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:33:50,842 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:33:50,842 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:33:50,843 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:33:50,843 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:33:50,844 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:33:50,844 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:33:50,844 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:33:50,845 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:33:50,846 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:33:50,846 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_04ddb564-7802-49bc-bf44-3d370f30d52b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 05:33:50,859 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:33:50,859 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:33:50,860 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:33:50,861 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:33:50,861 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:33:50,861 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:33:50,861 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:33:50,861 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:33:50,862 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:33:50,862 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:33:50,862 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:33:50,862 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:33:50,862 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:33:50,862 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:33:50,863 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:33:50,863 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:33:50,863 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:33:50,863 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:33:50,863 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:33:50,864 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:33:50,864 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:33:50,864 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:33:50,864 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:33:50,864 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:33:50,865 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:33:50,865 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:33:50,865 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:33:50,865 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:33:50,865 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:33:50,865 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:33:50,866 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:33:50,866 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_04ddb564-7802-49bc-bf44-3d370f30d52b/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-11-10 05:33:50,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:33:50,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:33:50,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:33:50,907 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:33:50,907 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:33:50,908 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_04ddb564-7802-49bc-bf44-3d370f30d52b/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-11-10 05:33:50,945 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04ddb564-7802-49bc-bf44-3d370f30d52b/bin-2019/uautomizer/data/0e8992636/9c65033fa6c44ced94a80195efbbeb3d/FLAGc987bda42 [2018-11-10 05:33:51,391 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:33:51,392 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_04ddb564-7802-49bc-bf44-3d370f30d52b/sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-11-10 05:33:51,398 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04ddb564-7802-49bc-bf44-3d370f30d52b/bin-2019/uautomizer/data/0e8992636/9c65033fa6c44ced94a80195efbbeb3d/FLAGc987bda42 [2018-11-10 05:33:51,406 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_04ddb564-7802-49bc-bf44-3d370f30d52b/bin-2019/uautomizer/data/0e8992636/9c65033fa6c44ced94a80195efbbeb3d [2018-11-10 05:33:51,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:33:51,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:33:51,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:33:51,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:33:51,412 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:33:51,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:33:51" (1/1) ... [2018-11-10 05:33:51,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c80a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:51, skipping insertion in model container [2018-11-10 05:33:51,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:33:51" (1/1) ... [2018-11-10 05:33:51,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:33:51,448 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:33:51,619 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:33:51,627 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:33:51,653 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:33:51,685 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:33:51,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:51 WrapperNode [2018-11-10 05:33:51,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:33:51,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:33:51,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:33:51,687 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:33:51,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:51" (1/1) ... [2018-11-10 05:33:51,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:51" (1/1) ... [2018-11-10 05:33:51,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:33:51,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:33:51,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:33:51,769 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:33:51,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:51" (1/1) ... [2018-11-10 05:33:51,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:51" (1/1) ... [2018-11-10 05:33:51,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:51" (1/1) ... [2018-11-10 05:33:51,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:51" (1/1) ... [2018-11-10 05:33:51,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:51" (1/1) ... [2018-11-10 05:33:51,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:51" (1/1) ... [2018-11-10 05:33:51,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:51" (1/1) ... [2018-11-10 05:33:51,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:33:51,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:33:51,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:33:51,787 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:33:51,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04ddb564-7802-49bc-bf44-3d370f30d52b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:33:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:33:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:33:51,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:33:51,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:33:52,022 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:33:52,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:33:52 BoogieIcfgContainer [2018-11-10 05:33:52,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:33:52,023 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:33:52,023 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:33:52,026 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:33:52,027 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:33:52,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:33:51" (1/3) ... [2018-11-10 05:33:52,028 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@779e71ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:33:52, skipping insertion in model container [2018-11-10 05:33:52,029 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:33:52,029 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:51" (2/3) ... [2018-11-10 05:33:52,029 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@779e71ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:33:52, skipping insertion in model container [2018-11-10 05:33:52,029 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:33:52,029 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:33:52" (3/3) ... [2018-11-10 05:33:52,031 INFO L375 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-11-10 05:33:52,075 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:33:52,076 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:33:52,076 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:33:52,076 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:33:52,076 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:33:52,076 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:33:52,077 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:33:52,077 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:33:52,077 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:33:52,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-10 05:33:52,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 05:33:52,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:33:52,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:33:52,109 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:33:52,109 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:33:52,110 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:33:52,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-10 05:33:52,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 05:33:52,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:33:52,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:33:52,111 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:33:52,111 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:33:52,117 INFO L793 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 6#L557true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 8#L557-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_sumOfThirdBytes } true;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; 15#L545-4true [2018-11-10 05:33:52,117 INFO L795 eck$LassoCheckResult]: Loop: 15#L545-4true assume true; 9#L545-1true assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + sumOfThirdBytes_~i~0 * 4;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset + 2; 10#L548-4true assume !true; 13#L545-3true sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := sumOfThirdBytes_#t~post2 + 1;havoc sumOfThirdBytes_#t~post2; 15#L545-4true [2018-11-10 05:33:52,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:52,121 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-10 05:33:52,123 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:33:52,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:33:52,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:52,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:52,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:52,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:52,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1329224, now seen corresponding path program 1 times [2018-11-10 05:33:52,210 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:33:52,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:33:52,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:52,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:52,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:52,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:33:52,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:33:52,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:33:52,236 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:33:52,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 05:33:52,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 05:33:52,247 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-10 05:33:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:33:52,253 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-10 05:33:52,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 05:33:52,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-11-10 05:33:52,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 05:33:52,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 16 transitions. [2018-11-10 05:33:52,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 05:33:52,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 05:33:52,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-10 05:33:52,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:33:52,260 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-10 05:33:52,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-10 05:33:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-10 05:33:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-10 05:33:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-10 05:33:52,279 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-10 05:33:52,279 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-10 05:33:52,279 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:33:52,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-11-10 05:33:52,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 05:33:52,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:33:52,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:33:52,280 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:33:52,280 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:33:52,280 INFO L793 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 57#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 51#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 52#L557-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_sumOfThirdBytes } true;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; 55#L545-4 [2018-11-10 05:33:52,280 INFO L795 eck$LassoCheckResult]: Loop: 55#L545-4 assume true; 56#L545-1 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + sumOfThirdBytes_~i~0 * 4;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset + 2; 50#L548-4 assume true; 48#L548-1 SUMMARY for call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L548-1 49#L548-2 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 53#L545-3 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := sumOfThirdBytes_#t~post2 + 1;havoc sumOfThirdBytes_#t~post2; 55#L545-4 [2018-11-10 05:33:52,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:52,280 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-10 05:33:52,281 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:33:52,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:33:52,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:52,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:52,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:52,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:52,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1276985362, now seen corresponding path program 1 times [2018-11-10 05:33:52,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:33:52,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:33:52,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:52,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:33:52,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:52,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:52,315 INFO L82 PathProgramCache]: Analyzing trace with hash -2015042314, now seen corresponding path program 1 times [2018-11-10 05:33:52,315 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:33:52,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:33:52,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:52,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:52,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:52,575 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:33:52,576 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:33:52,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:33:52,576 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:33:52,576 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:33:52,576 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:33:52,576 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:33:52,576 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:33:52,577 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-10 05:33:52,577 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:33:52,577 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:33:52,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:52,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:52,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:52,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:52,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:52,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:52,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:52,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:52,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:52,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:52,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:52,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:52,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:52,948 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:33:52,951 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:33:52,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:52,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:52,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:52,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:52,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:52,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:52,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:52,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:52,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:52,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:52,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:52,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:52,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:52,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:52,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:52,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:52,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:52,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:52,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:52,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:52,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:52,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:52,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:52,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:52,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:52,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:52,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:52,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:52,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:52,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:52,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:52,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:52,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:52,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:52,972 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:52,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:52,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:52,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:52,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:52,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:52,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:52,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:52,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:52,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:52,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:52,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:52,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:52,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:52,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:52,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:52,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:52,982 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:52,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:52,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:52,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:52,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:52,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:52,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:52,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:52,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:52,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:52,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:52,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:52,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:52,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:52,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:52,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:52,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:52,992 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:52,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-11-10 05:33:52,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:52,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:52,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:52,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:52,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:52,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:52,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:52,995 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:52,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:52,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:52,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:52,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:52,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:52,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:52,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:53,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,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-11-10 05:33:53,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:53,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:53,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:53,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:53,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:53,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:53,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:53,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:53,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:53,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:53,020 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:53,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:53,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:53,022 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:53,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:53,079 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:33:53,109 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 05:33:53,110 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 05:33:53,111 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:33:53,112 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:33:53,113 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:33:53,113 INFO L519 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-11-10 05:33:53,117 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-10 05:33:53,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:53,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:33:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:53,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:33:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:33:53,188 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 05:33:53,189 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-10 05:33:53,213 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 24 states and 28 transitions. Complement of second has 6 states. [2018-11-10 05:33:53,214 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-11-10 05:33:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:33:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-10 05:33:53,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-10 05:33:53,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:33:53,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-10 05:33:53,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:33:53,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-10 05:33:53,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:33:53,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-11-10 05:33:53,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:33:53,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 27 transitions. [2018-11-10 05:33:53,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-10 05:33:53,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 05:33:53,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-10 05:33:53,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:33:53,221 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 05:33:53,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-10 05:33:53,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 05:33:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 05:33:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 05:33:53,223 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 05:33:53,223 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 05:33:53,223 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:33:53,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-10 05:33:53,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:33:53,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:33:53,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:33:53,224 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:33:53,224 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:33:53,224 INFO L793 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 151#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 152#L557-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_sumOfThirdBytes } true;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; 156#L545-4 assume true; 157#L545-1 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + sumOfThirdBytes_~i~0 * 4;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset + 2; 145#L548-4 [2018-11-10 05:33:53,225 INFO L795 eck$LassoCheckResult]: Loop: 145#L548-4 assume true; 147#L548-1 SUMMARY for call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L548-1 148#L548-2 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := sumOfThirdBytes_#t~post4 + 1;havoc sumOfThirdBytes_#t~post4; 153#L550 SUMMARY for call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L550 162#L550-1 sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5; 141#L550-2 SUMMARY for call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L550-2 142#L550-3 havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 145#L548-4 [2018-11-10 05:33:53,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:53,225 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-10 05:33:53,225 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:33:53,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:33:53,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:53,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:53,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:53,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:53,241 INFO L82 PathProgramCache]: Analyzing trace with hash 507861116, now seen corresponding path program 1 times [2018-11-10 05:33:53,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:33:53,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:33:53,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:53,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:53,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:53,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:53,249 INFO L82 PathProgramCache]: Analyzing trace with hash 633989139, now seen corresponding path program 1 times [2018-11-10 05:33:53,249 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:33:53,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:33:53,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:53,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:53,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:53,425 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2018-11-10 05:33:53,471 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:33:53,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:33:53,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:33:53,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:33:53,471 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:33:53,471 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:33:53,471 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:33:53,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:33:53,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 05:33:53,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:33:53,472 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:33:53,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:53,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:53,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:53,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:53,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:53,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:53,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:53,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:53,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:53,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:53,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:53,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:53,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:53,616 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2018-11-10 05:33:53,850 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:33:53,850 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:33:53,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:53,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:53,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:53,852 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:53,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:53,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:53,856 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:53,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:53,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:53,858 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:53,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:53,861 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:53,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:53,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:53,863 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:53,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:53,866 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:53,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:53,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:53,868 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:53,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:53,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:53,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:53,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:53,875 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:53,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:53,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:53,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:53,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:53,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:53,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:53,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:53,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:53,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:53,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:53,884 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,885 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:33:53,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,887 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:33:53,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:53,895 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:53,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:53,899 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:53,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:53,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:53,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:53,919 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:53,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:53,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:53,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:53,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:53,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:53,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:53,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:53,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:53,922 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:33:53,923 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:33:53,923 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:33:53,923 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:33:53,923 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:33:53,924 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:33:53,924 INFO L519 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-11-10 05:33:53,951 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 05:33:53,952 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:33:53,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:53,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:33:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:53,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:33:54,039 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:33:54,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 05:33:54,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-10 05:33:54,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:33:54,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:33:54,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:33:54,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-11-10 05:33:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:33:54,080 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 05:33:54,080 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 8 states. [2018-11-10 05:33:54,126 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 8 states. Result 62 states and 70 transitions. Complement of second has 13 states. [2018-11-10 05:33:54,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 05:33:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:33:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2018-11-10 05:33:54,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 6 letters. Loop has 7 letters. [2018-11-10 05:33:54,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:33:54,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 05:33:54,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:33:54,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 6 letters. Loop has 14 letters. [2018-11-10 05:33:54,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:33:54,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 70 transitions. [2018-11-10 05:33:54,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:33:54,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 39 states and 45 transitions. [2018-11-10 05:33:54,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 05:33:54,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 05:33:54,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 45 transitions. [2018-11-10 05:33:54,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:33:54,134 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-10 05:33:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 45 transitions. [2018-11-10 05:33:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-10 05:33:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 05:33:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-10 05:33:54,137 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 05:33:54,137 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 05:33:54,137 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:33:54,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-11-10 05:33:54,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:33:54,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:33:54,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:33:54,138 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:33:54,138 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:33:54,138 INFO L793 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 333#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 325#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 326#L557-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_sumOfThirdBytes } true;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; 329#L545-4 assume true; 336#L545-1 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + sumOfThirdBytes_~i~0 * 4;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset + 2; 346#L548-4 assume true; 323#L548-1 SUMMARY for call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L548-1 324#L548-2 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 328#L545-3 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := sumOfThirdBytes_#t~post2 + 1;havoc sumOfThirdBytes_#t~post2; 334#L545-4 assume true; 330#L545-1 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + sumOfThirdBytes_~i~0 * 4;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset + 2; 319#L548-4 [2018-11-10 05:33:54,138 INFO L795 eck$LassoCheckResult]: Loop: 319#L548-4 assume true; 321#L548-1 SUMMARY for call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L548-1 322#L548-2 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := sumOfThirdBytes_#t~post4 + 1;havoc sumOfThirdBytes_#t~post4; 327#L550 SUMMARY for call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L550 337#L550-1 sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5; 315#L550-2 SUMMARY for call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L550-2 316#L550-3 havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 319#L548-4 [2018-11-10 05:33:54,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:54,139 INFO L82 PathProgramCache]: Analyzing trace with hash 574587163, now seen corresponding path program 2 times [2018-11-10 05:33:54,139 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:33:54,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:33:54,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:54,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:54,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:54,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:54,152 INFO L82 PathProgramCache]: Analyzing trace with hash 507861116, now seen corresponding path program 2 times [2018-11-10 05:33:54,152 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:33:54,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:33:54,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:54,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:33:54,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:54,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:54,161 INFO L82 PathProgramCache]: Analyzing trace with hash -878623198, now seen corresponding path program 1 times [2018-11-10 05:33:54,161 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:33:54,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:33:54,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:54,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:33:54,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:33:54,347 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2018-11-10 05:33:54,393 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:33:54,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:33:54,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:33:54,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:33:54,393 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:33:54,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:33:54,394 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:33:54,394 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:33:54,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-10 05:33:54,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:33:54,394 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:33:54,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:54,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:54,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:54,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:54,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:54,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:54,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:54,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:54,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:54,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:54,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:54,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:54,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:33:54,769 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:33:54,769 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:33:54,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:54,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:54,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:54,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:54,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:54,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:54,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:54,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:54,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:54,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:54,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:54,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:54,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:54,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:54,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:54,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:54,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:54,773 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:54,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:54,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:54,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:54,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:54,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:54,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:54,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:54,780 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:54,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:54,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:54,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:54,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:54,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:54,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:54,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:54,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:54,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:54,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:54,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:54,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:54,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:54,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:54,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:54,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:54,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:54,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:54,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:54,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:54,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:54,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:54,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:54,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:54,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:54,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:54,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:54,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:54,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:54,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:54,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:54,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:54,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:54,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:54,800 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:54,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:54,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:54,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:54,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:54,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:54,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:54,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:54,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:54,802 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:54,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:54,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:54,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:54,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:54,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:54,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:54,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:54,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:54,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:54,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:54,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:54,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:54,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:54,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:54,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:54,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:54,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:54,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:54,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:54,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:54,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:54,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:54,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:54,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:54,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:54,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:54,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:54,833 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:33:54,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:54,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:54,835 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:33:54,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:54,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:54,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:54,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:54,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:54,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:54,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:54,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:33:54,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:33:54,847 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:33:54,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:33:54,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:33:54,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:33:54,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:33:54,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:33:54,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:33:54,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:33:54,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:33:54,850 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:33:54,851 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:33:54,851 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:33:54,851 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:33:54,851 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:33:54,851 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:33:54,852 INFO L519 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-11-10 05:33:54,869 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-10 05:33:54,871 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:33:54,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:54,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:33:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:54,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:33:54,957 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:33:54,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 05:33:54,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-10 05:33:54,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:33:54,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:33:54,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:33:54,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-11-10 05:33:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:33:54,978 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 05:33:54,978 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-10 05:33:55,017 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 52 states and 60 transitions. Complement of second has 13 states. [2018-11-10 05:33:55,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 05:33:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:33:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2018-11-10 05:33:55,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-10 05:33:55,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:33:55,019 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:33:55,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:55,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:33:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:55,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:33:55,072 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:33:55,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 05:33:55,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-10 05:33:55,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:33:55,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:33:55,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:33:55,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-11-10 05:33:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:33:55,096 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 05:33:55,096 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-10 05:33:55,149 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 51 states and 59 transitions. Complement of second has 15 states. [2018-11-10 05:33:55,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 05:33:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:33:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-11-10 05:33:55,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-10 05:33:55,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:33:55,150 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:33:55,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:55,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:33:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:55,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:33:55,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:33:55,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 05:33:55,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-10 05:33:55,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:33:55,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:33:55,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:33:55,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-11-10 05:33:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:33:55,225 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 6 loop predicates [2018-11-10 05:33:55,225 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-10 05:33:55,261 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 63 states and 73 transitions. Complement of second has 12 states. [2018-11-10 05:33:55,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 05:33:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:33:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-10 05:33:55,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-10 05:33:55,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:33:55,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 19 letters. Loop has 7 letters. [2018-11-10 05:33:55,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:33:55,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 12 letters. Loop has 14 letters. [2018-11-10 05:33:55,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:33:55,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 73 transitions. [2018-11-10 05:33:55,269 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:33:55,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 0 states and 0 transitions. [2018-11-10 05:33:55,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:33:55,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:33:55,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:33:55,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:33:55,269 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:33:55,269 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:33:55,269 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:33:55,269 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:33:55,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:33:55,270 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:33:55,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:33:55,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:33:55 BoogieIcfgContainer [2018-11-10 05:33:55,275 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:33:55,275 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:33:55,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:33:55,276 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:33:55,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:33:52" (3/4) ... [2018-11-10 05:33:55,280 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:33:55,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:33:55,281 INFO L168 Benchmark]: Toolchain (without parser) took 3872.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.9 MB). Free memory was 956.5 MB in the beginning and 1.0 GB in the end (delta: -81.5 MB). Peak memory consumption was 142.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:33:55,282 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:33:55,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.26 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 935.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:33:55,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 935.0 MB in the beginning and 1.2 GB in the end (delta: -236.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:33:55,283 INFO L168 Benchmark]: Boogie Preprocessor took 17.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:33:55,283 INFO L168 Benchmark]: RCFGBuilder took 236.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:33:55,284 INFO L168 Benchmark]: BuchiAutomizer took 3251.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 49.3 MB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 115.4 MB). Peak memory consumption was 164.6 MB. Max. memory is 11.5 GB. [2018-11-10 05:33:55,284 INFO L168 Benchmark]: Witness Printer took 4.83 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-11-10 05:33:55,286 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.26 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 935.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 935.0 MB in the beginning and 1.2 GB in the end (delta: -236.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 236.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3251.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 49.3 MB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 115.4 MB). Peak memory consumption was 164.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.83 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 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 92 SDtfs, 83 SDslu, 64 SDs, 0 SdLazy, 109 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital143 mio100 ax100 hnf98 lsp91 ukn92 mio100 lsp53 div100 bol100 ite100 ukn100 eq193 hnf89 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 6 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...