./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/count_up_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/termination-15/count_up_alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:01:31,927 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:01:31,929 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:01:31,942 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:01:31,942 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:01:31,943 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:01:31,944 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:01:31,946 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:01:31,948 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:01:31,949 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:01:31,949 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:01:31,950 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:01:31,951 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:01:31,952 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:01:31,953 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:01:31,954 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:01:31,955 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:01:31,956 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:01:31,958 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:01:31,960 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:01:31,961 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:01:31,962 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:01:31,965 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:01:31,965 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:01:31,965 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:01:31,966 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:01:31,967 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:01:31,968 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:01:31,969 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:01:31,970 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:01:31,970 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:01:31,971 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:01:31,971 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:01:31,971 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:01:31,972 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:01:31,973 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:01:31,973 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:01:31,991 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:01:31,992 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:01:31,993 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:01:31,993 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:01:31,993 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:01:31,995 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:01:31,995 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:01:31,995 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:01:31,996 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:01:31,996 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:01:31,996 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:01:31,996 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:01:31,996 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:01:31,996 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:01:31,998 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:01:31,999 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:01:31,999 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:01:31,999 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:01:31,999 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:01:31,999 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:01:31,999 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:01:32,000 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:01:32,003 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:01:32,003 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:01:32,003 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:01:32,003 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:01:32,003 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:01:32,003 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:01:32,004 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:01:32,005 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b [2019-01-01 22:01:32,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:01:32,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:01:32,079 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:01:32,081 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:01:32,081 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:01:32,082 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/count_up_alloca_true-termination.c.i [2019-01-01 22:01:32,147 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b18e4ccfc/5e05ef03d5b14c1083d2e93f510ee29b/FLAG31e6aabc2 [2019-01-01 22:01:32,750 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:01:32,752 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/count_up_alloca_true-termination.c.i [2019-01-01 22:01:32,767 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b18e4ccfc/5e05ef03d5b14c1083d2e93f510ee29b/FLAG31e6aabc2 [2019-01-01 22:01:32,996 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b18e4ccfc/5e05ef03d5b14c1083d2e93f510ee29b [2019-01-01 22:01:33,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:01:33,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:01:33,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:01:33,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:01:33,010 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:01:33,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:01:32" (1/1) ... [2019-01-01 22:01:33,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2453995c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:01:33, skipping insertion in model container [2019-01-01 22:01:33,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:01:32" (1/1) ... [2019-01-01 22:01:33,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:01:33,068 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:01:33,488 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:01:33,499 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:01:33,640 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:01:33,719 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:01:33,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:01:33 WrapperNode [2019-01-01 22:01:33,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:01:33,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:01:33,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:01:33,721 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:01:33,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:01:33" (1/1) ... [2019-01-01 22:01:33,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:01:33" (1/1) ... [2019-01-01 22:01:33,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:01:33,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:01:33,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:01:33,785 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:01:33,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:01:33" (1/1) ... [2019-01-01 22:01:33,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:01:33" (1/1) ... [2019-01-01 22:01:33,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:01:33" (1/1) ... [2019-01-01 22:01:33,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:01:33" (1/1) ... [2019-01-01 22:01:33,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:01:33" (1/1) ... [2019-01-01 22:01:33,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:01:33" (1/1) ... [2019-01-01 22:01:33,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:01:33" (1/1) ... [2019-01-01 22:01:33,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:01:33,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:01:33,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:01:33,829 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:01:33,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:01:33" (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 [2019-01-01 22:01:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:01:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:01:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:01:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:01:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:01:33,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:01:34,382 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:01:34,383 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 22:01:34,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:01:34 BoogieIcfgContainer [2019-01-01 22:01:34,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:01:34,385 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:01:34,385 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:01:34,388 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:01:34,389 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:01:34,389 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:01:32" (1/3) ... [2019-01-01 22:01:34,390 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5751d913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:01:34, skipping insertion in model container [2019-01-01 22:01:34,390 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:01:34,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:01:33" (2/3) ... [2019-01-01 22:01:34,391 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5751d913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:01:34, skipping insertion in model container [2019-01-01 22:01:34,391 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:01:34,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:01:34" (3/3) ... [2019-01-01 22:01:34,394 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_up_alloca_true-termination.c.i [2019-01-01 22:01:34,454 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:01:34,455 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:01:34,455 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:01:34,455 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:01:34,455 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:01:34,455 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:01:34,456 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:01:34,456 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:01:34,456 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:01:34,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:01:34,496 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 22:01:34,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:01:34,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:01:34,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:01:34,506 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:01:34,506 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:01:34,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:01:34,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 22:01:34,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:01:34,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:01:34,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:01:34,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:01:34,521 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 15#L369true assume !(main_~length~0 < 1); 20#L369-2true call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 12#L371true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 16#L372-3true [2019-01-01 22:01:34,522 INFO L796 eck$LassoCheckResult]: Loop: 16#L372-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 7#L374true assume main_~val~0 > main_~limit~0;main_~val~0 := main_~limit~0; 10#L374-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 13#L372-2true main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 16#L372-3true [2019-01-01 22:01:34,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:34,529 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-01 22:01:34,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:34,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:34,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:34,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:01:34,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:34,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:34,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2019-01-01 22:01:34,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:34,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:34,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:34,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:01:34,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:34,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2019-01-01 22:01:34,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:34,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:34,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:34,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:01:34,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:34,853 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 22:01:35,306 WARN L181 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-01-01 22:01:35,377 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:01:35,379 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:01:35,379 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:01:35,379 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:01:35,379 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:01:35,379 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:01:35,380 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:01:35,380 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:01:35,380 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 22:01:35,380 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:01:35,380 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:01:35,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:35,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:35,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:35,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:35,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:35,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:35,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:35,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:35,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:35,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:35,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:35,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:35,726 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-01 22:01:36,173 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-01 22:01:36,480 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:01:36,486 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:01:36,488 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 [2019-01-01 22:01:36,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:36,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:36,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:36,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:36,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:36,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:36,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:36,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:36,498 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 [2019-01-01 22:01:36,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:36,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:36,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:36,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:36,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:36,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:36,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:36,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:36,502 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 [2019-01-01 22:01:36,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:36,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:36,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:36,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:36,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:36,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:36,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:36,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:36,506 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 [2019-01-01 22:01:36,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:36,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:36,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:36,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:36,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:36,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:36,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:36,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:36,510 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 [2019-01-01 22:01:36,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:36,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:36,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:36,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:36,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:01:36,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:36,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:36,521 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 [2019-01-01 22:01:36,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:36,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:36,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:36,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:36,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:36,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:36,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:36,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:36,525 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 [2019-01-01 22:01:36,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:36,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:36,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:36,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:36,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:36,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:36,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:36,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:36,529 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 [2019-01-01 22:01:36,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:36,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:36,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:36,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:36,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:36,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:36,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:36,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:36,532 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 [2019-01-01 22:01:36,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:36,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:36,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:36,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:36,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:36,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:36,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:36,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:36,536 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 [2019-01-01 22:01:36,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:36,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:36,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:36,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:36,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:36,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:36,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:36,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:36,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 [2019-01-01 22:01:36,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:36,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:36,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:36,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:36,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:01:36,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:36,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:36,549 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 [2019-01-01 22:01:36,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:36,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:36,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:36,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:36,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:01:36,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:36,656 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:01:36,709 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 22:01:36,709 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 22:01:36,712 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:01:36,716 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:01:36,717 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:01:36,717 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-01-01 22:01:36,747 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 22:01:36,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:01:36,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:01:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:01:36,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:01:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:01:36,902 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 [2019-01-01 22:01:36,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-01-01 22:01:36,990 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2019-01-01 22:01:36,991 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 [2019-01-01 22:01:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:01:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2019-01-01 22:01:36,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 22:01:36,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:01:36,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-01 22:01:36,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:01:36,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-01 22:01:36,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:01:37,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2019-01-01 22:01:37,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:01:37,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2019-01-01 22:01:37,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 22:01:37,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:01:37,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-01-01 22:01:37,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:01:37,012 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-01 22:01:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-01-01 22:01:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-01 22:01:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 22:01:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-01-01 22:01:37,044 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-01 22:01:37,045 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-01 22:01:37,045 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:01:37,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-01-01 22:01:37,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:01:37,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:01:37,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:01:37,047 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:01:37,047 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:01:37,047 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 134#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 135#L369 assume !(main_~length~0 < 1); 140#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 137#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#L372-3 assume !(main_~i~0 < main_~length~0); 141#L372-4 main_~j~0 := 0; 130#L379-3 [2019-01-01 22:01:37,048 INFO L796 eck$LassoCheckResult]: Loop: 130#L379-3 assume !!(main_~j~0 < main_~length~0); 127#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 128#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 129#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 130#L379-3 [2019-01-01 22:01:37,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:37,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2019-01-01 22:01:37,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:37,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:37,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:37,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:01:37,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:01:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:01:37,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:01:37,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:01:37,132 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:01:37,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:37,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2019-01-01 22:01:37,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:37,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:37,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:37,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:01:37,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:37,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:01:37,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:01:37,225 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-01 22:01:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:01:37,284 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-01 22:01:37,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:01:37,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-01 22:01:37,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:01:37,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2019-01-01 22:01:37,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 22:01:37,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:01:37,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-01-01 22:01:37,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:01:37,290 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-01 22:01:37,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-01-01 22:01:37,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-01-01 22:01:37,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 22:01:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-01-01 22:01:37,292 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-01 22:01:37,292 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-01 22:01:37,292 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:01:37,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-01-01 22:01:37,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:01:37,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:01:37,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:01:37,294 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:01:37,294 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:01:37,294 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 175#L369 assume !(main_~length~0 < 1); 180#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 177#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 178#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 171#L374 assume !(main_~val~0 > main_~limit~0); 172#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 173#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 179#L372-3 assume !(main_~i~0 < main_~length~0); 181#L372-4 main_~j~0 := 0; 170#L379-3 [2019-01-01 22:01:37,295 INFO L796 eck$LassoCheckResult]: Loop: 170#L379-3 assume !!(main_~j~0 < main_~length~0); 167#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 168#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 169#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 170#L379-3 [2019-01-01 22:01:37,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:37,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2019-01-01 22:01:37,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:37,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:37,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:37,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:01:37,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:37,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:37,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2019-01-01 22:01:37,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:37,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:37,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:37,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:01:37,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2019-01-01 22:01:37,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:37,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:37,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:37,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:01:37,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:37,831 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-01-01 22:01:37,919 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:01:37,919 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:01:37,919 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:01:37,919 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:01:37,919 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:01:37,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:01:37,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:01:37,920 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:01:37,920 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 22:01:37,921 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:01:37,921 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:01:37,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:37,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:37,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:37,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:37,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:37,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:37,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:37,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:37,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:38,151 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-01-01 22:01:38,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:38,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:38,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:38,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:38,573 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:01:38,573 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:01:38,574 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 [2019-01-01 22:01:38,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:38,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:38,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:38,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:38,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:38,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:38,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:38,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:38,580 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 [2019-01-01 22:01:38,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:38,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:38,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:38,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:38,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:38,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:38,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:38,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:38,586 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 [2019-01-01 22:01:38,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:38,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:38,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:38,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:38,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:38,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:38,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:38,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:38,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:01:38,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:38,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:38,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:38,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:38,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:38,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:38,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:38,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:38,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:01:38,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:38,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:38,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:38,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:38,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:38,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:38,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:38,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:38,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:01:38,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:38,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:38,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:38,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:38,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:01:38,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:38,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:38,605 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 [2019-01-01 22:01:38,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:38,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:38,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:38,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:38,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:38,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:38,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:38,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:38,615 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 [2019-01-01 22:01:38,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:38,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:38,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:38,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:38,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:01:38,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:38,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:38,624 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 [2019-01-01 22:01:38,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:38,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:38,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:38,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:38,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:01:38,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:38,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:38,646 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 [2019-01-01 22:01:38,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:38,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:38,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:38,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:38,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:01:38,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:38,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:38,663 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 [2019-01-01 22:01:38,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:38,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:38,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:38,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:38,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:01:38,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:38,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:38,671 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 [2019-01-01 22:01:38,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:38,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:38,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:38,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:38,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:01:38,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:38,721 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:01:38,761 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 22:01:38,761 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 22:01:38,761 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:01:38,763 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:01:38,764 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:01:38,764 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 Supporting invariants [] [2019-01-01 22:01:38,840 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 22:01:38,855 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:01:38,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:01:38,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:01:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:01:38,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:01:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:01:38,991 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 [2019-01-01 22:01:38,991 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 22:01:39,032 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2019-01-01 22:01:39,033 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 [2019-01-01 22:01:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:01:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-01 22:01:39,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-01 22:01:39,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:01:39,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2019-01-01 22:01:39,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:01:39,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2019-01-01 22:01:39,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:01:39,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-01-01 22:01:39,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:01:39,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2019-01-01 22:01:39,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 22:01:39,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:01:39,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-01-01 22:01:39,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:01:39,038 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-01 22:01:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-01-01 22:01:39,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-01-01 22:01:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 22:01:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-01-01 22:01:39,041 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-01 22:01:39,041 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-01 22:01:39,042 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:01:39,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-01-01 22:01:39,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:01:39,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:01:39,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:01:39,043 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:01:39,043 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:01:39,043 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 293#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 294#L369 assume !(main_~length~0 < 1); 300#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 295#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 296#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 290#L374 assume !(main_~val~0 > main_~limit~0); 291#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 292#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 298#L372-3 assume !(main_~i~0 < main_~length~0); 299#L372-4 main_~j~0 := 0; 289#L379-3 assume !!(main_~j~0 < main_~length~0); 283#L380-3 [2019-01-01 22:01:39,044 INFO L796 eck$LassoCheckResult]: Loop: 283#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 284#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 283#L380-3 [2019-01-01 22:01:39,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:39,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2019-01-01 22:01:39,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:39,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:39,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:39,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:01:39,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:39,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:39,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2019-01-01 22:01:39,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:39,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:39,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:39,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:01:39,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:39,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:39,095 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2019-01-01 22:01:39,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:39,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:39,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:39,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:01:39,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:39,261 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 22:01:39,503 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-01-01 22:01:39,618 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:01:39,618 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:01:39,618 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:01:39,618 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:01:39,619 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:01:39,620 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:01:39,620 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:01:39,620 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:01:39,620 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration4_Lasso [2019-01-01 22:01:39,620 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:01:39,620 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:01:39,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:39,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:39,834 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-01-01 22:01:40,061 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-01-01 22:01:40,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:40,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:40,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:40,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:40,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:40,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:40,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:40,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:40,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:40,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:40,491 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:01:40,491 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:01:40,492 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 [2019-01-01 22:01:40,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:40,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:40,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:40,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:40,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:40,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:40,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:40,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:40,498 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 [2019-01-01 22:01:40,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:40,499 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:01:40,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:40,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:40,503 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:01:40,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:40,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:40,512 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 [2019-01-01 22:01:40,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:40,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:40,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:40,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:40,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:01:40,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:40,553 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:01:40,570 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 22:01:40,570 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-01 22:01:40,571 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:01:40,575 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:01:40,576 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:01:40,576 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2) = 1*ULTIMATE.start_main_~limit~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2019-01-01 22:01:40,681 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 22:01:40,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:01:40,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:01:40,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:01:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:01:40,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:01:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:01:41,068 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 [2019-01-01 22:01:41,068 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 22:01:41,106 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 27 states and 35 transitions. Complement of second has 7 states. [2019-01-01 22:01:41,108 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 [2019-01-01 22:01:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:01:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-01 22:01:41,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-01 22:01:41,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:01:41,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-01 22:01:41,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:01:41,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2019-01-01 22:01:41,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:01:41,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2019-01-01 22:01:41,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:01:41,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2019-01-01 22:01:41,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 22:01:41,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 22:01:41,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2019-01-01 22:01:41,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:01:41,112 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-01-01 22:01:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2019-01-01 22:01:41,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-01 22:01:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 22:01:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-01-01 22:01:41,115 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-01 22:01:41,115 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-01 22:01:41,115 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:01:41,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2019-01-01 22:01:41,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:01:41,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:01:41,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:01:41,117 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:01:41,117 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:01:41,117 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 420#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 421#L369 assume !(main_~length~0 < 1); 427#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 424#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 425#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 418#L374 assume !(main_~val~0 > main_~limit~0); 419#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 422#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 426#L372-3 assume !(main_~i~0 < main_~length~0); 428#L372-4 main_~j~0 := 0; 416#L379-3 assume !!(main_~j~0 < main_~length~0); 417#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 430#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 414#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 415#L379-3 assume !!(main_~j~0 < main_~length~0); 410#L380-3 [2019-01-01 22:01:41,117 INFO L796 eck$LassoCheckResult]: Loop: 410#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 411#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 410#L380-3 [2019-01-01 22:01:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:41,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2019-01-01 22:01:41,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:41,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:41,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:41,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:01:41,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:01:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:01:41,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:01:41,331 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 [2019-01-01 22:01:41,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:01:41,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:01:41,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:01:41,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:01:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:01:41,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:01:41,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-01-01 22:01:41,513 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:01:41,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:41,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2019-01-01 22:01:41,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:41,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:41,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:41,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:01:41,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:41,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 22:01:41,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-01-01 22:01:41,647 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand 14 states. [2019-01-01 22:01:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:01:42,050 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2019-01-01 22:01:42,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 22:01:42,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2019-01-01 22:01:42,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:01:42,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2019-01-01 22:01:42,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 22:01:42,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 22:01:42,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-01-01 22:01:42,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:01:42,056 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-01 22:01:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-01-01 22:01:42,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-01-01 22:01:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 22:01:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-01-01 22:01:42,061 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-01-01 22:01:42,062 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-01-01 22:01:42,062 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:01:42,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-01-01 22:01:42,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:01:42,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:01:42,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:01:42,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:01:42,063 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:01:42,064 INFO L794 eck$LassoCheckResult]: Stem: 566#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 564#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 565#L369 assume !(main_~length~0 < 1); 572#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 567#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 568#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 571#L374 assume !(main_~val~0 > main_~limit~0); 576#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 569#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 570#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 561#L374 assume !(main_~val~0 > main_~limit~0); 562#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 563#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 575#L372-3 assume !(main_~i~0 < main_~length~0); 574#L372-4 main_~j~0 := 0; 559#L379-3 assume !!(main_~j~0 < main_~length~0); 560#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 577#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 557#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 558#L379-3 assume !!(main_~j~0 < main_~length~0); 553#L380-3 [2019-01-01 22:01:42,064 INFO L796 eck$LassoCheckResult]: Loop: 553#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 554#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 553#L380-3 [2019-01-01 22:01:42,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:42,064 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2019-01-01 22:01:42,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:42,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:42,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:42,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:01:42,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:42,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:42,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2019-01-01 22:01:42,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:42,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:42,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:42,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:01:42,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:42,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2019-01-01 22:01:42,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:01:42,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:01:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:42,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:01:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:01:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:01:42,603 WARN L181 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-01-01 22:01:42,681 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:01:42,682 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:01:42,682 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:01:42,682 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:01:42,682 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:01:42,682 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:01:42,682 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:01:42,683 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:01:42,683 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration6_Lasso [2019-01-01 22:01:42,683 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:01:42,683 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:01:42,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:42,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:42,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:42,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:42,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:42,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:42,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:42,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:42,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:42,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:42,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:42,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:01:43,126 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:01:43,126 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:01:43,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 [2019-01-01 22:01:43,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:43,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:43,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:43,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:43,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:01:43,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:43,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:43,134 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 [2019-01-01 22:01:43,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:43,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:43,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:43,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:43,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:43,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:43,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:43,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:43,140 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 [2019-01-01 22:01:43,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:43,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:01:43,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:43,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:43,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:43,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:01:43,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:01:43,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:43,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 [2019-01-01 22:01:43,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:43,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:43,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:43,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:43,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:01:43,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:43,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:43,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:01:43,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:43,163 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:01:43,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:43,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:43,165 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:01:43,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:43,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:43,172 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 [2019-01-01 22:01:43,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:43,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:43,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:43,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:43,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:01:43,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:43,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:43,182 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 [2019-01-01 22:01:43,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:43,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:43,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:43,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:43,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:01:43,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:43,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:01:43,191 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 [2019-01-01 22:01:43,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:01:43,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:01:43,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:01:43,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:01:43,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:01:43,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:01:43,203 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:01:43,209 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:01:43,209 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:01:43,210 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:01:43,212 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:01:43,212 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:01:43,212 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_3) = 1*ULTIMATE.start_main_~limit~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_3 Supporting invariants [] [2019-01-01 22:01:43,327 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 22:01:43,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:01:43,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:01:43,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:01:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:01:43,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:01:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:01:43,501 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 [2019-01-01 22:01:43,501 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 22:01:43,561 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2019-01-01 22:01:43,562 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 [2019-01-01 22:01:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:01:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-01 22:01:43,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2019-01-01 22:01:43,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:01:43,564 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:01:43,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:01:43,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:01:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:01:43,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:01:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:01:43,809 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:01:43,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 22:01:43,873 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2019-01-01 22:01:43,876 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 [2019-01-01 22:01:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:01:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-01 22:01:43,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2019-01-01 22:01:43,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:01:43,877 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:01:43,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:01:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:01:43,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:01:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:01:43,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:01:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:01:43,971 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:01:43,971 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 22:01:43,994 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2019-01-01 22:01:43,995 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 [2019-01-01 22:01:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:01:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-01-01 22:01:43,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2019-01-01 22:01:43,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:01:43,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2019-01-01 22:01:43,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:01:43,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2019-01-01 22:01:43,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:01:43,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2019-01-01 22:01:43,999 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:01:44,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2019-01-01 22:01:44,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:01:44,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:01:44,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:01:44,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:01:44,000 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:01:44,000 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:01:44,000 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:01:44,001 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:01:44,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:01:44,001 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:01:44,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:01:44,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:01:44 BoogieIcfgContainer [2019-01-01 22:01:44,008 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:01:44,008 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:01:44,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:01:44,009 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:01:44,009 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:01:34" (3/4) ... [2019-01-01 22:01:44,014 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:01:44,014 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:01:44,015 INFO L168 Benchmark]: Toolchain (without parser) took 11014.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 950.0 MB in the beginning and 810.0 MB in the end (delta: 140.0 MB). Peak memory consumption was 339.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:01:44,017 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:01:44,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -140.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:01:44,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:01:44,021 INFO L168 Benchmark]: Boogie Preprocessor took 44.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:01:44,021 INFO L168 Benchmark]: RCFGBuilder took 555.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:01:44,023 INFO L168 Benchmark]: BuchiAutomizer took 9623.56 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 810.0 MB in the end (delta: 254.4 MB). Peak memory consumption was 341.9 MB. Max. memory is 11.5 GB. [2019-01-01 22:01:44,025 INFO L168 Benchmark]: Witness Printer took 5.60 ms. Allocated memory is still 1.2 GB. Free memory is still 810.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:01:44,030 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 717.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -140.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 555.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9623.56 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 810.0 MB in the end (delta: 254.4 MB). Peak memory consumption was 341.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.60 ms. Allocated memory is still 1.2 GB. Free memory is still 810.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + unknown-#length-unknown[arr] and consists of 4 locations. One deterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. One nondeterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 7.4s. Construction of modules took 0.3s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 110 SDtfs, 222 SDslu, 71 SDs, 0 SdLazy, 168 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital128 mio100 ax100 hnf98 lsp94 ukn80 mio100 lsp54 div100 bol100 ite100 ukn100 eq165 hnf89 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms 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...