./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/sum_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/reducercommutativity/sum_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e17f830a1ee9b998b40fe12c0d4d25b23cde3738 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:10:33,914 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:10:33,916 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:10:33,934 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:10:33,934 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:10:33,936 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:10:33,937 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:10:33,939 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:10:33,941 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:10:33,942 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:10:33,942 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:10:33,943 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:10:33,944 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:10:33,945 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:10:33,946 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:10:33,947 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:10:33,948 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:10:33,950 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:10:33,952 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:10:33,954 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:10:33,956 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:10:33,957 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:10:33,960 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:10:33,960 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:10:33,961 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:10:33,962 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:10:33,965 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:10:33,966 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:10:33,967 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:10:33,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:10:33,970 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:10:33,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:10:33,975 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:10:33,975 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:10:33,976 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:10:33,977 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:10:33,977 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:10:34,002 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:10:34,003 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:10:34,004 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:10:34,004 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:10:34,008 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:10:34,008 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:10:34,008 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:10:34,008 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:10:34,008 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:10:34,009 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:10:34,009 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:10:34,009 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:10:34,009 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:10:34,009 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:10:34,009 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:10:34,012 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:10:34,012 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:10:34,012 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:10:34,012 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:10:34,013 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:10:34,013 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:10:34,013 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:10:34,013 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:10:34,013 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:10:34,013 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:10:34,015 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:10:34,016 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:10:34,016 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:10:34,016 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:10:34,016 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:10:34,016 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:10:34,018 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:10:34,018 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e17f830a1ee9b998b40fe12c0d4d25b23cde3738 [2018-11-29 00:10:34,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:10:34,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:10:34,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:10:34,072 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:10:34,072 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:10:34,073 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/sum_true-unreach-call_true-termination.i [2018-11-29 00:10:34,132 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ac0493c/8355dbe9aa5143088a591a2d1828f882/FLAG18568959a [2018-11-29 00:10:34,610 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:10:34,610 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/sum_true-unreach-call_true-termination.i [2018-11-29 00:10:34,616 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ac0493c/8355dbe9aa5143088a591a2d1828f882/FLAG18568959a [2018-11-29 00:10:34,964 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ac0493c/8355dbe9aa5143088a591a2d1828f882 [2018-11-29 00:10:34,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:10:34,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:10:34,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:34,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:10:34,975 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:10:34,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:34" (1/1) ... [2018-11-29 00:10:34,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1435883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:34, skipping insertion in model container [2018-11-29 00:10:34,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:34" (1/1) ... [2018-11-29 00:10:34,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:10:35,003 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:10:35,217 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:35,228 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:10:35,253 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:35,276 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:10:35,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:35 WrapperNode [2018-11-29 00:10:35,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:35,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:35,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:10:35,278 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:10:35,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:35" (1/1) ... [2018-11-29 00:10:35,298 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:35" (1/1) ... [2018-11-29 00:10:35,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:35,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:10:35,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:10:35,327 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:10:35,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:35" (1/1) ... [2018-11-29 00:10:35,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:35" (1/1) ... [2018-11-29 00:10:35,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:35" (1/1) ... [2018-11-29 00:10:35,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:35" (1/1) ... [2018-11-29 00:10:35,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:35" (1/1) ... [2018-11-29 00:10:35,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:35" (1/1) ... [2018-11-29 00:10:35,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:35" (1/1) ... [2018-11-29 00:10:35,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:10:35,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:10:35,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:10:35,379 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:10:35,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:10:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:10:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:10:35,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:10:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:10:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:10:35,984 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:10:35,984 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-29 00:10:35,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:35 BoogieIcfgContainer [2018-11-29 00:10:35,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:10:35,986 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:10:35,986 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:10:35,991 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:10:35,992 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:35,992 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:10:34" (1/3) ... [2018-11-29 00:10:35,993 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@513cb359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:35, skipping insertion in model container [2018-11-29 00:10:35,994 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:35,994 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:35" (2/3) ... [2018-11-29 00:10:35,994 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@513cb359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:35, skipping insertion in model container [2018-11-29 00:10:35,995 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:35,995 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:35" (3/3) ... [2018-11-29 00:10:35,998 INFO L375 chiAutomizerObserver]: Analyzing ICFG sum_true-unreach-call_true-termination.i [2018-11-29 00:10:36,069 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:10:36,070 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:10:36,070 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:10:36,070 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:10:36,071 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:10:36,071 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:10:36,071 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:10:36,071 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:10:36,072 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:10:36,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-29 00:10:36,117 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-29 00:10:36,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:36,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:36,124 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-29 00:10:36,124 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:36,125 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:10:36,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-29 00:10:36,127 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-29 00:10:36,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:36,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:36,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-29 00:10:36,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:36,136 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 14#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 13#L20true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 9#L11-3true [2018-11-29 00:10:36,137 INFO L796 eck$LassoCheckResult]: Loop: 9#L11-3true assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 12#L11-2true sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 9#L11-3true [2018-11-29 00:10:36,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:36,144 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-29 00:10:36,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:36,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:36,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:36,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:36,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2018-11-29 00:10:36,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:36,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:36,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:36,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:36,291 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2018-11-29 00:10:36,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:36,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:36,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:36,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:36,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:36,688 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-29 00:10:36,855 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-29 00:10:36,865 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:36,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:36,867 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:36,867 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:36,867 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:36,867 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:36,867 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:36,867 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:36,867 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-29 00:10:36,868 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:36,868 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:36,895 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-29 00:10:36,922 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-29 00:10:36,935 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-29 00:10:36,939 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-29 00:10:36,941 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-29 00:10:36,947 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-29 00:10:36,954 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-29 00:10:36,956 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-29 00:10:36,964 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-29 00:10:36,969 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-29 00:10:36,974 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-29 00:10:36,977 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-29 00:10:36,982 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-29 00:10:36,994 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-29 00:10:37,268 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-11-29 00:10:37,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:37,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:37,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:37,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:37,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:37,323 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-29 00:10:37,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:37,754 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-29 00:10:38,117 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:38,123 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:38,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:38,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:38,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:38,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:38,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:38,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:38,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:38,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:38,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:38,137 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-29 00:10:38,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:38,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:38,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:38,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:38,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:38,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:38,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:38,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:38,146 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-29 00:10:38,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:38,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:38,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:38,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:38,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:38,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:38,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:38,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:38,151 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-29 00:10:38,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:38,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:38,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:38,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:38,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:38,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:38,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:38,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:38,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:38,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:38,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:38,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:38,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:38,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:38,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:38,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:38,166 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-29 00:10:38,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:38,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:38,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:38,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:38,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:38,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:38,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:38,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:38,170 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-29 00:10:38,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:38,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:38,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:38,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:38,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:38,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:38,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:38,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:38,173 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-29 00:10:38,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:38,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:38,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:38,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:38,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:38,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:38,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:38,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:38,177 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-29 00:10:38,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:38,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:38,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:38,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:38,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:38,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:38,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:38,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:38,180 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-29 00:10:38,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:38,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:38,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:38,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:38,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:38,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:38,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:38,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:38,183 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-29 00:10:38,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:38,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:38,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:38,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:38,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:38,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:38,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:38,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:38,187 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-29 00:10:38,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:38,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:38,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:38,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:38,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:38,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:38,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:38,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:38,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:38,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:38,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:38,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:38,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:38,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:38,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:38,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:38,198 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-29 00:10:38,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:38,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:38,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:38,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:38,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:38,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:38,313 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:38,411 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-29 00:10:38,411 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-29 00:10:38,414 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:38,416 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:38,417 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:38,417 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_sum_~x.offset) = -4*ULTIMATE.start_sum_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 1*ULTIMATE.start_sum_~x.offset Supporting invariants [] [2018-11-29 00:10:38,504 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-11-29 00:10:38,523 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:10:38,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:38,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:38,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:38,662 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-29 00:10:38,677 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-29 00:10:38,678 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2018-11-29 00:10:38,837 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 51 states and 69 transitions. Complement of second has 8 states. [2018-11-29 00:10:38,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:10:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-11-29 00:10:38,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-29 00:10:38,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:38,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-29 00:10:38,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:38,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-29 00:10:38,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:38,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2018-11-29 00:10:38,853 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-29 00:10:38,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 23 transitions. [2018-11-29 00:10:38,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-29 00:10:38,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-29 00:10:38,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-11-29 00:10:38,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:38,861 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-29 00:10:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-11-29 00:10:38,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-29 00:10:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-29 00:10:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-29 00:10:38,891 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-29 00:10:38,891 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-29 00:10:38,891 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:10:38,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-29 00:10:38,892 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-29 00:10:38,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:38,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:38,893 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:10:38,893 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:38,893 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 146#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 145#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 141#L11-3 assume !(sum_~i~0 < ~N~0); 137#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 138#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 150#L11-8 [2018-11-29 00:10:38,894 INFO L796 eck$LassoCheckResult]: Loop: 150#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 151#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 150#L11-8 [2018-11-29 00:10:38,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:38,894 INFO L82 PathProgramCache]: Analyzing trace with hash 889510859, now seen corresponding path program 1 times [2018-11-29 00:10:38,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:38,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:38,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:38,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:38,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:38,962 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-29 00:10:38,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:38,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:10:38,965 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:38,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:38,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2018-11-29 00:10:38,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:38,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:38,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:39,080 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-29 00:10:39,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:10:39,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:10:39,172 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-29 00:10:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:39,227 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-29 00:10:39,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:10:39,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-29 00:10:39,230 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-29 00:10:39,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-11-29 00:10:39,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-29 00:10:39,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-29 00:10:39,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-29 00:10:39,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:39,235 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-29 00:10:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-29 00:10:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-29 00:10:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-29 00:10:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-29 00:10:39,238 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-29 00:10:39,238 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-29 00:10:39,238 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:10:39,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-29 00:10:39,239 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-29 00:10:39,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:39,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:39,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:39,240 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:39,240 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 187#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 186#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 182#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 183#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 184#L11-3 assume !(sum_~i~0 < ~N~0); 178#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 179#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 191#L11-8 [2018-11-29 00:10:39,241 INFO L796 eck$LassoCheckResult]: Loop: 191#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 192#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 191#L11-8 [2018-11-29 00:10:39,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:39,241 INFO L82 PathProgramCache]: Analyzing trace with hash 123162473, now seen corresponding path program 1 times [2018-11-29 00:10:39,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:39,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:39,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:39,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:39,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:39,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:39,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:39,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:39,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:39,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-29 00:10:39,464 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:39,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:39,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 2 times [2018-11-29 00:10:39,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:39,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:39,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:39,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:39,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:10:39,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:10:39,537 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-29 00:10:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:39,693 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-29 00:10:39,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:10:39,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-29 00:10:39,696 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-29 00:10:39,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2018-11-29 00:10:39,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-29 00:10:39,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-29 00:10:39,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-29 00:10:39,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:39,698 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-29 00:10:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-29 00:10:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-29 00:10:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-29 00:10:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-29 00:10:39,701 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-29 00:10:39,701 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-29 00:10:39,701 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:10:39,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-29 00:10:39,702 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-29 00:10:39,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:39,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:39,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:39,704 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:39,704 INFO L794 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 255#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 254#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 249#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 250#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 251#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 252#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 261#L11-3 assume !(sum_~i~0 < ~N~0); 245#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 246#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 259#L11-8 [2018-11-29 00:10:39,704 INFO L796 eck$LassoCheckResult]: Loop: 259#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 260#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 259#L11-8 [2018-11-29 00:10:39,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:39,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228857, now seen corresponding path program 2 times [2018-11-29 00:10:39,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:39,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:39,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:39,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:39,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:39,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 3 times [2018-11-29 00:10:39,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:39,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:39,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:39,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:39,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:39,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1163170153, now seen corresponding path program 1 times [2018-11-29 00:10:39,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:39,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:39,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:39,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:39,977 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-29 00:10:40,104 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-29 00:10:40,773 WARN L180 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2018-11-29 00:10:41,152 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-29 00:10:41,169 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:41,169 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:41,169 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:41,169 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:41,169 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:41,170 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:41,170 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:41,170 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:41,170 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum_true-unreach-call_true-termination.i_Iteration4_Lasso [2018-11-29 00:10:41,170 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:41,170 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:41,178 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-29 00:10:41,205 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-29 00:10:41,218 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-29 00:10:41,223 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-29 00:10:41,225 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-29 00:10:41,229 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-29 00:10:42,001 WARN L180 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-11-29 00:10:42,055 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-29 00:10:42,057 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-29 00:10:42,060 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-29 00:10:42,062 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-29 00:10:42,065 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-29 00:10:42,068 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-29 00:10:42,071 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-29 00:10:42,074 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-29 00:10:42,076 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-29 00:10:42,077 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-29 00:10:42,079 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-29 00:10:42,083 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-29 00:10:42,085 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-29 00:10:42,523 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:42,524 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:42,524 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-29 00:10:42,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,530 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-29 00:10:42,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,535 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-29 00:10:42,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,540 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-29 00:10:42,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,545 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-29 00:10:42,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:42,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:42,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,555 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-29 00:10:42,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,555 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:42,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,560 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:42,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:42,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,570 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-29 00:10:42,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:42,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:42,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:42,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:42,575 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-29 00:10:42,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:42,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:42,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:42,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:42,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:42,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:42,602 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:42,627 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-29 00:10:42,627 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-29 00:10:42,628 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:42,630 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:42,630 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:42,630 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0, v_rep(select #length ULTIMATE.start_sum_~x.base)_2, ULTIMATE.start_sum_~x.offset) = -4*ULTIMATE.start_sum_~i~0 + 1*v_rep(select #length ULTIMATE.start_sum_~x.base)_2 - 1*ULTIMATE.start_sum_~x.offset Supporting invariants [] [2018-11-29 00:10:42,707 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:10:42,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:10:42,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:42,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:42,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:42,896 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-29 00:10:42,897 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-29 00:10:42,897 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-29 00:10:42,939 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 26 states and 33 transitions. Complement of second has 7 states. [2018-11-29 00:10:42,940 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-29 00:10:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-29 00:10:42,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-29 00:10:42,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:42,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-29 00:10:42,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:42,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-29 00:10:42,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:42,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-11-29 00:10:42,944 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:10:42,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 24 transitions. [2018-11-29 00:10:42,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-29 00:10:42,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-29 00:10:42,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2018-11-29 00:10:42,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:42,947 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-29 00:10:42,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2018-11-29 00:10:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-29 00:10:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-29 00:10:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-11-29 00:10:42,949 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-29 00:10:42,949 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-29 00:10:42,950 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:10:42,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2018-11-29 00:10:42,950 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:10:42,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:42,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:42,951 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:42,951 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:42,952 INFO L794 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 376#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 375#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 370#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 371#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 372#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 373#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 383#L11-3 assume !(sum_~i~0 < ~N~0); 366#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 367#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 380#L11-8 assume !(sum_~i~0 < ~N~0); 378#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 379#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 368#L32-3 [2018-11-29 00:10:42,952 INFO L796 eck$LassoCheckResult]: Loop: 368#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 369#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 368#L32-3 [2018-11-29 00:10:42,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:42,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1698534614, now seen corresponding path program 1 times [2018-11-29 00:10:42,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:42,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:42,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:42,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:42,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:10:43,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:43,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:10:43,056 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:43,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:43,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 1 times [2018-11-29 00:10:43,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:43,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:43,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:43,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:43,328 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-29 00:10:43,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:10:43,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:10:43,343 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-29 00:10:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:43,386 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-29 00:10:43,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:10:43,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-29 00:10:43,388 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:10:43,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2018-11-29 00:10:43,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-29 00:10:43,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-29 00:10:43,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-11-29 00:10:43,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:43,390 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-29 00:10:43,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-11-29 00:10:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-11-29 00:10:43,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-29 00:10:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-29 00:10:43,393 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-29 00:10:43,393 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-29 00:10:43,393 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:10:43,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-29 00:10:43,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:10:43,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:43,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:43,397 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:43,397 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:43,398 INFO L794 eck$LassoCheckResult]: Stem: 427#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 426#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 425#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 420#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 421#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 422#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 423#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 433#L11-3 assume !(sum_~i~0 < ~N~0); 416#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 417#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 430#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 431#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 432#L11-8 assume !(sum_~i~0 < ~N~0); 428#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 429#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 418#L32-3 [2018-11-29 00:10:43,398 INFO L796 eck$LassoCheckResult]: Loop: 418#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 419#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 418#L32-3 [2018-11-29 00:10:43,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:43,398 INFO L82 PathProgramCache]: Analyzing trace with hash 205910964, now seen corresponding path program 1 times [2018-11-29 00:10:43,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:43,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:43,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:43,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:43,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:10:43,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:43,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:43,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:43,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:10:43,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:43,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-29 00:10:43,690 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:43,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:43,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 2 times [2018-11-29 00:10:43,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:43,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:43,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:43,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:44,061 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-29 00:10:44,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:10:44,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:10:44,080 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-29 00:10:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:44,183 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-29 00:10:44,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:10:44,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2018-11-29 00:10:44,186 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:10:44,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 31 transitions. [2018-11-29 00:10:44,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-29 00:10:44,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-29 00:10:44,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2018-11-29 00:10:44,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:44,189 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-29 00:10:44,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2018-11-29 00:10:44,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2018-11-29 00:10:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-29 00:10:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-29 00:10:44,191 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-29 00:10:44,191 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-29 00:10:44,191 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:10:44,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-11-29 00:10:44,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:10:44,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:44,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:44,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:44,194 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:44,196 INFO L794 eck$LassoCheckResult]: Stem: 529#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 528#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 527#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 522#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 523#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 524#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 525#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 536#L11-3 assume !(sum_~i~0 < ~N~0); 518#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 519#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 532#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 533#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 534#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 535#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 537#L11-8 assume !(sum_~i~0 < ~N~0); 530#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 531#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 520#L32-3 [2018-11-29 00:10:44,196 INFO L796 eck$LassoCheckResult]: Loop: 520#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 521#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 520#L32-3 [2018-11-29 00:10:44,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:44,196 INFO L82 PathProgramCache]: Analyzing trace with hash 313660178, now seen corresponding path program 2 times [2018-11-29 00:10:44,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:44,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:44,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:44,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:44,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:44,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 3 times [2018-11-29 00:10:44,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:44,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:44,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:44,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:44,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:44,285 INFO L82 PathProgramCache]: Analyzing trace with hash 779721780, now seen corresponding path program 1 times [2018-11-29 00:10:44,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:44,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:44,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:44,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:44,472 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-29 00:10:45,112 WARN L180 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 136 [2018-11-29 00:10:45,748 WARN L180 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2018-11-29 00:10:45,750 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:45,750 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:45,751 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:45,751 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:45,751 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:45,751 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:45,752 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:45,752 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:45,752 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-29 00:10:45,752 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:45,752 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:45,759 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-29 00:10:45,774 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-29 00:10:45,776 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-29 00:10:45,781 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-29 00:10:45,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:45,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:45,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:45,797 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-29 00:10:45,950 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-29 00:10:46,487 WARN L180 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2018-11-29 00:10:46,595 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-29 00:10:46,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:46,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-29 00:10:46,601 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-29 00:10:46,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-29 00:10:46,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:46,611 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-29 00:10:46,613 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-29 00:10:47,209 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-29 00:10:48,007 WARN L180 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-11-29 00:10:48,035 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:48,036 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:48,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:48,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:48,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:48,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:48,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,043 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-29 00:10:48,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:48,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:48,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:48,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,049 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-29 00:10:48,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:48,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:48,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,056 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-29 00:10:48,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:48,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:48,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:48,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,062 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-29 00:10:48,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:48,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:48,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:48,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,067 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-29 00:10:48,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:48,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:48,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:48,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,073 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-29 00:10:48,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:48,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:48,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,081 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-29 00:10:48,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:48,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:48,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,090 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-29 00:10:48,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,090 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:48,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,091 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:48,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:48,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:48,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:48,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:48,122 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:48,133 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:10:48,133 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-29 00:10:48,133 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:48,134 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:48,134 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:48,135 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ~N~0) = -1*ULTIMATE.start_main_~i~1 + 1*~N~0 Supporting invariants [] [2018-11-29 00:10:48,378 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-29 00:10:48,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:48,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:48,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:48,657 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-29 00:10:48,658 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-29 00:10:48,658 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-29 00:10:48,687 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 27 states and 34 transitions. Complement of second has 6 states. [2018-11-29 00:10:48,688 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-29 00:10:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-29 00:10:48,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-29 00:10:48,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:48,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 19 letters. Loop has 2 letters. [2018-11-29 00:10:48,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:48,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 4 letters. [2018-11-29 00:10:48,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:48,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-11-29 00:10:48,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:48,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 27 transitions. [2018-11-29 00:10:48,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-29 00:10:48,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-29 00:10:48,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-29 00:10:48,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:48,696 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-29 00:10:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-29 00:10:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-29 00:10:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-29 00:10:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-29 00:10:48,698 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-29 00:10:48,698 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-29 00:10:48,698 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:10:48,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-29 00:10:48,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:48,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:48,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:48,700 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:48,700 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:48,700 INFO L794 eck$LassoCheckResult]: Stem: 695#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 694#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 693#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 688#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 689#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 690#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 691#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 702#L11-3 assume !(sum_~i~0 < ~N~0); 683#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 684#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 698#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 699#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 700#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 701#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 703#L11-8 assume !(sum_~i~0 < ~N~0); 696#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 697#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 685#L32-3 assume !(main_~i~1 < ~N~0 - 1); 681#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 682#L11-13 [2018-11-29 00:10:48,700 INFO L796 eck$LassoCheckResult]: Loop: 682#L11-13 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 692#L11-12 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 682#L11-13 [2018-11-29 00:10:48,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,701 INFO L82 PathProgramCache]: Analyzing trace with hash 779721722, now seen corresponding path program 1 times [2018-11-29 00:10:48,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:48,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:48,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:48,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-29 00:10:48,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:48,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:10:48,792 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:48,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2018-11-29 00:10:48,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:48,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:48,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:48,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:48,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:10:48,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:10:48,881 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-29 00:10:48,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:48,910 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-29 00:10:48,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:10:48,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2018-11-29 00:10:48,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:48,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 27 transitions. [2018-11-29 00:10:48,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-29 00:10:48,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-29 00:10:48,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-11-29 00:10:48,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:48,915 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-29 00:10:48,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-11-29 00:10:48,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-29 00:10:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-29 00:10:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-29 00:10:48,918 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-29 00:10:48,918 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-29 00:10:48,918 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:10:48,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2018-11-29 00:10:48,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:48,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:48,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:48,920 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:48,920 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:48,920 INFO L794 eck$LassoCheckResult]: Stem: 749#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 748#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 747#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 742#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 743#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 744#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 745#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 756#L11-3 assume !(sum_~i~0 < ~N~0); 737#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 738#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 752#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 753#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 754#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 755#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 757#L11-8 assume !(sum_~i~0 < ~N~0); 750#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 751#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 739#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 740#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 741#L32-3 assume !(main_~i~1 < ~N~0 - 1); 735#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 736#L11-13 [2018-11-29 00:10:48,920 INFO L796 eck$LassoCheckResult]: Loop: 736#L11-13 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 746#L11-12 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 736#L11-13 [2018-11-29 00:10:48,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1988322460, now seen corresponding path program 1 times [2018-11-29 00:10:48,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:48,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:48,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:48,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:48,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2018-11-29 00:10:48,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:48,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:48,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:48,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:48,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash -482560770, now seen corresponding path program 1 times [2018-11-29 00:10:48,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:48,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:48,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:48,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:50,338 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 209 DAG size of output: 174 [2018-11-29 00:10:53,045 WARN L180 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 102 DAG size of output: 98 [2018-11-29 00:10:53,047 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:53,047 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:53,047 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:53,047 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:53,047 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:53,048 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:53,048 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:53,048 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:53,048 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-29 00:10:53,048 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:53,048 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:53,054 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-29 00:10:53,069 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-29 00:10:53,070 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-29 00:10:53,072 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-29 00:10:53,074 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-29 00:10:53,082 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-29 00:10:53,083 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-29 00:10:53,085 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-29 00:10:53,091 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-29 00:10:53,092 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-29 00:10:53,176 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-29 00:10:53,733 WARN L180 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2018-11-29 00:10:53,790 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-29 00:10:53,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:53,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:53,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:53,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:53,797 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-29 00:10:53,799 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-29 00:10:53,931 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-11-29 00:10:54,224 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-11-29 00:10:54,346 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:54,346 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:54,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:54,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:54,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:54,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:54,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:54,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:54,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:54,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:54,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:54,348 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-29 00:10:54,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:54,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:54,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:54,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:54,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:54,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:54,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:54,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:54,357 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-29 00:10:54,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:54,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:54,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:54,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:54,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:54,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:54,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:54,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:54,364 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-29 00:10:54,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:54,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:54,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:54,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:54,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:54,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:54,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:54,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:54,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:54,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:54,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:54,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:54,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:54,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:54,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:54,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:54,369 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-29 00:10:54,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:54,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:54,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:54,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:54,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:54,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:54,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:54,372 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-29 00:10:54,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:54,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:54,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:54,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:54,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:54,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:54,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:54,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:54,374 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-29 00:10:54,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:54,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:54,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:54,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:54,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:54,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:54,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:54,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:54,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:54,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:54,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:54,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:54,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:54,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:54,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:54,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:54,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:54,377 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-29 00:10:54,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:54,378 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:54,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:54,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:54,379 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:54,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:54,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:54,384 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-29 00:10:54,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:54,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:54,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:54,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:54,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:54,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:54,419 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:54,464 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-29 00:10:54,465 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-29 00:10:54,466 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:54,466 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:54,468 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:54,469 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0, ULTIMATE.start_sum_~x.offset, v_rep(select #length ULTIMATE.start_sum_~x.base)_4) = -4*ULTIMATE.start_sum_~i~0 - 1*ULTIMATE.start_sum_~x.offset + 1*v_rep(select #length ULTIMATE.start_sum_~x.base)_4 Supporting invariants [] [2018-11-29 00:10:54,583 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:10:54,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:10:54,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:54,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:54,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:55,121 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-29 00:10:55,122 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-29 00:10:55,122 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-29 00:10:55,187 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 25 states and 29 transitions. Complement of second has 4 states. [2018-11-29 00:10:55,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:10:55,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-29 00:10:55,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 2 letters. [2018-11-29 00:10:55,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:55,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 23 letters. Loop has 2 letters. [2018-11-29 00:10:55,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:55,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 4 letters. [2018-11-29 00:10:55,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:55,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2018-11-29 00:10:55,194 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:10:55,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-11-29 00:10:55,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:10:55,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:10:55,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:10:55,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:55,195 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:55,195 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:55,195 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:55,195 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-29 00:10:55,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:10:55,195 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:10:55,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:10:55,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:10:55 BoogieIcfgContainer [2018-11-29 00:10:55,208 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:10:55,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:10:55,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:10:55,209 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:10:55,209 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:35" (3/4) ... [2018-11-29 00:10:55,217 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:10:55,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:10:55,218 INFO L168 Benchmark]: Toolchain (without parser) took 20248.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.8 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -83.7 MB). Peak memory consumption was 224.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:55,220 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:10:55,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.26 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:55,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.25 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:10:55,223 INFO L168 Benchmark]: Boogie Preprocessor took 51.47 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:55,225 INFO L168 Benchmark]: RCFGBuilder took 606.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:55,227 INFO L168 Benchmark]: BuchiAutomizer took 19222.46 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.0 MB). Peak memory consumption was 245.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:55,228 INFO L168 Benchmark]: Witness Printer took 8.68 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-29 00:10:55,235 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 306.26 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.25 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.47 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 606.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19222.46 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.0 MB). Peak memory consumption was 245.2 MB. Max. memory is 11.5 GB. * Witness Printer took 8.68 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (5 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[x] + -1 * x and consists of 5 locations. One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[x] + -1 * x and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -4 * i + -1 * x + unknown-#length-unknown[x] and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.1s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 17.0s. Construction of modules took 0.4s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 108 SDtfs, 110 SDslu, 44 SDs, 0 SdLazy, 179 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital356 mio100 ax100 hnf99 lsp111 ukn63 mio100 lsp53 div104 bol100 ite100 ukn100 eq164 hnf81 smp85 dnf204 smp61 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 3 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...