./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/mult_array-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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-memory-alloca/mult_array-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 23c47ba60fd5b5d47afa1439cbedebaab58a1798 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:34:18,677 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:34:18,679 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:34:18,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:34:18,691 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:34:18,692 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:34:18,693 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:34:18,695 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:34:18,697 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:34:18,698 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:34:18,699 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:34:18,699 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:34:18,700 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:34:18,701 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:34:18,703 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:34:18,703 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:34:18,704 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:34:18,706 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:34:18,709 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:34:18,710 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:34:18,711 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:34:18,713 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:34:18,715 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:34:18,715 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:34:18,716 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:34:18,717 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:34:18,718 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:34:18,719 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:34:18,720 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:34:18,721 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:34:18,721 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:34:18,722 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:34:18,722 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:34:18,723 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:34:18,724 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:34:18,724 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:34:18,725 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:34:18,744 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:34:18,745 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:34:18,746 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:34:18,746 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:34:18,746 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:34:18,746 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:34:18,746 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:34:18,747 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:34:18,747 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:34:18,748 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:34:18,748 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:34:18,748 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:34:18,748 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:34:18,748 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:34:18,748 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:34:18,749 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:34:18,749 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:34:18,749 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:34:18,749 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:34:18,749 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:34:18,749 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:34:18,751 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:34:18,751 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:34:18,751 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:34:18,752 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:34:18,752 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:34:18,752 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:34:18,752 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:34:18,753 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:34:18,753 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 -> 23c47ba60fd5b5d47afa1439cbedebaab58a1798 [2019-01-14 02:34:18,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:34:18,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:34:18,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:34:18,831 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:34:18,831 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:34:18,832 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/mult_array-alloca_true-termination.c.i [2019-01-14 02:34:18,899 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26adcb1a6/3d230ac3726842548703969d4d9aae9d/FLAG0000c6d73 [2019-01-14 02:34:19,395 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:34:19,396 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/mult_array-alloca_true-termination.c.i [2019-01-14 02:34:19,408 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26adcb1a6/3d230ac3726842548703969d4d9aae9d/FLAG0000c6d73 [2019-01-14 02:34:19,717 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26adcb1a6/3d230ac3726842548703969d4d9aae9d [2019-01-14 02:34:19,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:34:19,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:34:19,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:34:19,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:34:19,726 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:34:19,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:34:19" (1/1) ... [2019-01-14 02:34:19,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e2c51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:19, skipping insertion in model container [2019-01-14 02:34:19,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:34:19" (1/1) ... [2019-01-14 02:34:19,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:34:19,786 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:34:20,123 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:34:20,137 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:34:20,265 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:34:20,317 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:34:20,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:20 WrapperNode [2019-01-14 02:34:20,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:34:20,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:34:20,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:34:20,319 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:34:20,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:20" (1/1) ... [2019-01-14 02:34:20,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:20" (1/1) ... [2019-01-14 02:34:20,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:34:20,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:34:20,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:34:20,368 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:34:20,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:20" (1/1) ... [2019-01-14 02:34:20,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:20" (1/1) ... [2019-01-14 02:34:20,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:20" (1/1) ... [2019-01-14 02:34:20,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:20" (1/1) ... [2019-01-14 02:34:20,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:20" (1/1) ... [2019-01-14 02:34:20,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:20" (1/1) ... [2019-01-14 02:34:20,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:20" (1/1) ... [2019-01-14 02:34:20,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:34:20,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:34:20,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:34:20,398 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:34:20,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:20" (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-14 02:34:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:34:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:34:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:34:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:34:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:34:20,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:34:20,847 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:34:20,848 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:34:20,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:34:20 BoogieIcfgContainer [2019-01-14 02:34:20,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:34:20,850 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:34:20,850 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:34:20,853 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:34:20,853 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:34:20,853 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:34:19" (1/3) ... [2019-01-14 02:34:20,854 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12dca813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:34:20, skipping insertion in model container [2019-01-14 02:34:20,855 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:34:20,855 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:34:20" (2/3) ... [2019-01-14 02:34:20,855 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12dca813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:34:20, skipping insertion in model container [2019-01-14 02:34:20,855 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:34:20,855 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:34:20" (3/3) ... [2019-01-14 02:34:20,857 INFO L375 chiAutomizerObserver]: Analyzing ICFG mult_array-alloca_true-termination.c.i [2019-01-14 02:34:20,906 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:34:20,907 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:34:20,907 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:34:20,907 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:34:20,908 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:34:20,908 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:34:20,908 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:34:20,908 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:34:20,908 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:34:20,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 02:34:20,941 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:34:20,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:20,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:20,947 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:34:20,947 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:34:20,947 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:34:20,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 02:34:20,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:34:20,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:20,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:20,950 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:34:20,950 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:34:20,956 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~nondet2, main_#t~nondet3, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_#t~mem9, main_#t~post8, main_~i~0, main_~j~0, main_~length~0, main_~fac~0, main_~arr~0.base, main_~arr~0.offset, main_~arr2~0.base, main_~arr2~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 16#L550true assume !(main_~length~0 < 1); 3#L550-2true main_~fac~0 := main_#t~nondet3;havoc main_#t~nondet3; 12#L552true assume !(main_~fac~0 < 1); 17#L552-2true call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4 * (main_~fac~0 * main_~length~0));main_~arr2~0.base, main_~arr2~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 6#L555true assume !((main_~arr~0.base == 0 && main_~arr~0.offset == 0) || (main_~arr2~0.base == 0 && main_~arr2~0.offset == 0));main_~i~0 := 0; 10#L556-3true [2019-01-14 02:34:20,956 INFO L796 eck$LassoCheckResult]: Loop: 10#L556-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet7, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet7; 8#L556-2true main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 10#L556-3true [2019-01-14 02:34:20,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:20,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815374, now seen corresponding path program 1 times [2019-01-14 02:34:20,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:20,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:21,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:21,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:21,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:21,039 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 02:34:21,039 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 02:34:21,039 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 02:34:21,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:21,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:21,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2019-01-14 02:34:21,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:21,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:21,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:21,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:21,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:21,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:21,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1182787760, now seen corresponding path program 1 times [2019-01-14 02:34:21,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:21,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:21,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:21,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:21,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:21,168 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 02:34:21,168 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 02:34:21,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 02:34:21,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:21,404 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 02:34:21,559 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 02:34:22,008 WARN L181 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-01-14 02:34:22,222 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 02:34:22,244 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:34:22,245 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:34:22,246 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:34:22,246 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:34:22,246 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:34:22,246 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:34:22,246 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:34:22,247 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:34:22,247 INFO L131 ssoRankerPreferences]: Filename of dumped script: mult_array-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:34:22,247 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:34:22,247 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:34:22,278 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-14 02:34:22,734 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-01-14 02:34:22,766 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-14 02:34:22,769 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-14 02:34:22,771 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-14 02:34:22,776 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-14 02:34:22,778 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-14 02:34:22,791 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-14 02:34:22,793 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-14 02:34:22,796 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-14 02:34:22,800 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-14 02:34:22,802 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-14 02:34:22,804 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-14 02:34:22,807 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-14 02:34:22,811 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-14 02:34:23,559 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 02:34:23,716 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:34:23,721 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:34:23,723 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-14 02:34:23,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:23,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:23,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:23,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:23,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:23,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:23,860 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:34:23,931 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:34:23,931 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:34:23,934 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:34:23,936 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:34:23,937 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:34:23,938 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2019-01-14 02:34:24,051 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-14 02:34:24,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:34:24,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:24,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:24,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:24,171 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-14 02:34:24,184 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-14 02:34:24,186 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-01-14 02:34:24,246 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 35 states and 46 transitions. Complement of second has 7 states. [2019-01-14 02:34:24,247 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-14 02:34:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:34:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2019-01-14 02:34:24,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:34:24,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:24,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:34:24,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:24,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 02:34:24,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:24,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2019-01-14 02:34:24,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:34:24,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 17 transitions. [2019-01-14 02:34:24,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:34:24,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:34:24,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-14 02:34:24,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:34:24,265 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:34:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-14 02:34:24,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 02:34:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:34:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-14 02:34:24,288 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:34:24,288 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:34:24,288 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:34:24,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-14 02:34:24,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:34:24,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:24,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:24,291 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:34:24,291 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:34:24,292 INFO L794 eck$LassoCheckResult]: Stem: 137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 129#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_#t~mem9, main_#t~post8, main_~i~0, main_~j~0, main_~length~0, main_~fac~0, main_~arr~0.base, main_~arr~0.offset, main_~arr2~0.base, main_~arr2~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 130#L550 assume !(main_~length~0 < 1); 131#L550-2 main_~fac~0 := main_#t~nondet3;havoc main_#t~nondet3; 132#L552 assume !(main_~fac~0 < 1); 139#L552-2 call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4 * (main_~fac~0 * main_~length~0));main_~arr2~0.base, main_~arr2~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 141#L555 assume !((main_~arr~0.base == 0 && main_~arr~0.offset == 0) || (main_~arr2~0.base == 0 && main_~arr2~0.offset == 0));main_~i~0 := 0; 133#L556-3 assume !(main_~i~0 < main_~length~0); 134#L556-4 main_~j~0 := 0; 138#L559-3 [2019-01-14 02:34:24,292 INFO L796 eck$LassoCheckResult]: Loop: 138#L559-3 assume !!(main_~j~0 < main_~length~0 * main_~fac~0);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (if main_~i~0 < 0 && 0 != main_~i~0 % main_~length~0 then (if main_~length~0 < 0 then main_~i~0 % main_~length~0 + main_~length~0 else main_~i~0 % main_~length~0 - main_~length~0) else main_~i~0 % main_~length~0), 4);call write~int(main_#t~mem9, main_~arr2~0.base, main_~arr2~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem9; 140#L559-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 138#L559-3 [2019-01-14 02:34:24,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:24,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1182787702, now seen corresponding path program 1 times [2019-01-14 02:34:24,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:24,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:24,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:24,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,298 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 02:34:24,299 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 02:34:24,299 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 02:34:24,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:24,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:24,361 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-14 02:34:24,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:34:24,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:34:24,385 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:34:24,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:24,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2339, now seen corresponding path program 1 times [2019-01-14 02:34:24,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:24,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:24,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:24,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,389 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 02:34:24,389 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 02:34:24,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 02:34:24,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:24,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:34:24,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:34:24,571 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 02:34:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:34:24,643 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-01-14 02:34:24,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:34:24,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-01-14 02:34:24,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:34:24,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 17 transitions. [2019-01-14 02:34:24,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:34:24,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:34:24,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-01-14 02:34:24,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:34:24,647 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-14 02:34:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-01-14 02:34:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-14 02:34:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:34:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-01-14 02:34:24,649 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-01-14 02:34:24,649 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-01-14 02:34:24,649 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:34:24,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-01-14 02:34:24,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:34:24,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:24,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:24,650 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:34:24,651 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:34:24,651 INFO L794 eck$LassoCheckResult]: Stem: 195#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 187#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_#t~mem9, main_#t~post8, main_~i~0, main_~j~0, main_~length~0, main_~fac~0, main_~arr~0.base, main_~arr~0.offset, main_~arr2~0.base, main_~arr2~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 188#L550 assume !(main_~length~0 < 1); 189#L550-2 main_~fac~0 := main_#t~nondet3;havoc main_#t~nondet3; 190#L552 assume !(main_~fac~0 < 1); 196#L552-2 call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4 * (main_~fac~0 * main_~length~0));main_~arr2~0.base, main_~arr2~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 199#L555 assume !((main_~arr~0.base == 0 && main_~arr~0.offset == 0) || (main_~arr2~0.base == 0 && main_~arr2~0.offset == 0));main_~i~0 := 0; 191#L556-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet7, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet7; 192#L556-2 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 193#L556-3 assume !(main_~i~0 < main_~length~0); 194#L556-4 main_~j~0 := 0; 197#L559-3 [2019-01-14 02:34:24,651 INFO L796 eck$LassoCheckResult]: Loop: 197#L559-3 assume !!(main_~j~0 < main_~length~0 * main_~fac~0);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (if main_~i~0 < 0 && 0 != main_~i~0 % main_~length~0 then (if main_~length~0 < 0 then main_~i~0 % main_~length~0 + main_~length~0 else main_~i~0 % main_~length~0 - main_~length~0) else main_~i~0 % main_~length~0), 4);call write~int(main_#t~mem9, main_~arr2~0.base, main_~arr2~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem9; 198#L559-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 197#L559-3 [2019-01-14 02:34:24,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:24,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1507295208, now seen corresponding path program 1 times [2019-01-14 02:34:24,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:24,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:24,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:24,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,655 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 02:34:24,656 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 02:34:24,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 02:34:24,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:24,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:24,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2339, now seen corresponding path program 2 times [2019-01-14 02:34:24,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:24,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:24,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:24,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,752 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 02:34:24,752 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 02:34:24,752 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 02:34:24,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:34:24,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 02:34:24,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 02:34:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:24,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1106714758, now seen corresponding path program 1 times [2019-01-14 02:34:24,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:24,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:24,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:34:24,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:24,809 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 02:34:24,809 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 02:34:24,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 02:34:24,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:25,239 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-01-14 02:34:25,377 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-14 02:34:25,391 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:34:25,391 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:34:25,391 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:34:25,391 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:34:25,391 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:34:25,391 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:34:25,391 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:34:25,392 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:34:25,392 INFO L131 ssoRankerPreferences]: Filename of dumped script: mult_array-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:34:25,393 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:34:25,393 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:34:25,399 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-14 02:34:25,425 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-14 02:34:25,446 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-14 02:34:25,450 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-14 02:34:25,454 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-14 02:34:25,455 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-14 02:34:25,458 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-14 02:34:25,460 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-14 02:34:25,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-14 02:34:26,156 WARN L181 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-01-14 02:34:26,295 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-01-14 02:34:26,295 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-14 02:34:26,298 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-14 02:34:26,300 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-14 02:34:26,303 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-14 02:34:26,539 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-01-14 02:34:26,980 WARN L181 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 50 [2019-01-14 02:34:27,308 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-14 02:34:27,482 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 02:34:27,583 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 02:34:27,643 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:34:27,643 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:34:27,644 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-14 02:34:27,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:27,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:27,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:27,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:27,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:27,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:27,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:27,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:27,647 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-14 02:34:27,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:27,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:27,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:27,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:27,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:27,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:27,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:27,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:27,650 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-14 02:34:27,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:27,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:27,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:27,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:27,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:27,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:27,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:27,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:27,652 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-14 02:34:27,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:27,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:27,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:27,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:27,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:27,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:27,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:27,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:27,654 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-14 02:34:27,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:27,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:27,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:27,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:27,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:27,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:27,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:27,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:27,656 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-14 02:34:27,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:27,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:27,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:27,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:27,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:27,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:27,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:27,662 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-14 02:34:27,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:27,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:27,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:27,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:27,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:27,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:27,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:27,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:27,666 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-14 02:34:27,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:27,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:27,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:27,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:27,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:27,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:27,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:27,672 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-14 02:34:27,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:27,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:27,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:27,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:27,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:27,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:27,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:27,687 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-14 02:34:27,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:27,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:27,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:27,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:27,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:27,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:27,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:27,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:27,690 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-14 02:34:27,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:27,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:27,691 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:34:27,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:27,719 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 02:34:27,719 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:34:27,882 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:34:27,985 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:34:27,985 INFO L444 ModelExtractionUtils]: 55 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:34:27,986 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:34:27,989 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-14 02:34:27,989 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:34:27,989 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~arr2~0.base)_1, ULTIMATE.start_main_~arr2~0.offset) = -4*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr2~0.base)_1 - 1*ULTIMATE.start_main_~arr2~0.offset Supporting invariants [] [2019-01-14 02:34:28,286 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-14 02:34:28,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:34:28,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:28,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:28,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:28,412 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-14 02:34:28,413 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-14 02:34:28,413 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:34:28,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 15 states and 19 transitions. Complement of second has 4 states. [2019-01-14 02:34:28,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:34:28,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:34:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-14 02:34:28,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 02:34:28,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:28,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-14 02:34:28,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:28,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-14 02:34:28,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:28,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-01-14 02:34:28,446 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:34:28,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2019-01-14 02:34:28,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:34:28,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:34:28,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:34:28,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:34:28,447 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:34:28,447 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:34:28,447 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:34:28,447 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:34:28,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:34:28,448 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:34:28,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:34:28,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:34:28 BoogieIcfgContainer [2019-01-14 02:34:28,455 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:34:28,455 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:34:28,455 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:34:28,455 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:34:28,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:34:20" (3/4) ... [2019-01-14 02:34:28,460 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:34:28,460 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:34:28,461 INFO L168 Benchmark]: Toolchain (without parser) took 8740.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 947.3 MB in the beginning and 856.8 MB in the end (delta: 90.5 MB). Peak memory consumption was 309.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:34:28,462 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:34:28,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 595.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:34:28,463 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:34:28,464 INFO L168 Benchmark]: Boogie Preprocessor took 28.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:34:28,464 INFO L168 Benchmark]: RCFGBuilder took 451.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:34:28,465 INFO L168 Benchmark]: BuchiAutomizer took 7605.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 856.8 MB in the end (delta: 256.6 MB). Peak memory consumption was 324.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:34:28,466 INFO L168 Benchmark]: Witness Printer took 4.84 ms. Allocated memory is still 1.2 GB. Free memory is still 856.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:34:28,472 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 595.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 451.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7605.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 856.8 MB in the end (delta: 256.6 MB). Peak memory consumption was 324.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.84 ms. Allocated memory is still 1.2 GB. Free memory is still 856.8 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 #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has affine ranking function -4 * j + unknown-#length-unknown[arr2] + -1 * arr2 and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 7.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 41 SDtfs, 41 SDslu, 19 SDs, 0 SdLazy, 26 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital210 mio100 ax109 hnf99 lsp86 ukn88 mio100 lsp65 div114 bol100 ite182 ukn100 eq153 hnf92 smp62 dnf129 smp97 tf100 neg96 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 298ms VariablesStem: 12 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...