./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f9c03ff796f05925e62ae0f4fb320e42fa8b7c37 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:57:45,057 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:57:45,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:57:45,071 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:57:45,071 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:57:45,072 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:57:45,074 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:57:45,076 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:57:45,078 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:57:45,079 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:57:45,080 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:57:45,080 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:57:45,082 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:57:45,083 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:57:45,084 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:57:45,085 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:57:45,086 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:57:45,088 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:57:45,090 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:57:45,092 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:57:45,093 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:57:45,094 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:57:45,097 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:57:45,097 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:57:45,098 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:57:45,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:57:45,100 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:57:45,101 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:57:45,101 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:57:45,103 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:57:45,103 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:57:45,104 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:57:45,104 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:57:45,105 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:57:45,106 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:57:45,107 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:57:45,107 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:57:45,124 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:57:45,124 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:57:45,125 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:57:45,126 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:57:45,126 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:57:45,126 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:57:45,126 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:57:45,126 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:57:45,127 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:57:45,127 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:57:45,127 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:57:45,127 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:57:45,127 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:57:45,128 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:57:45,129 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:57:45,129 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:57:45,129 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:57:45,129 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:57:45,130 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:57:45,130 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:57:45,130 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:57:45,130 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:57:45,130 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:57:45,130 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:57:45,131 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:57:45,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:57:45,132 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:57:45,133 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:57:45,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:57:45,133 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:57:45,133 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:57:45,135 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:57:45,135 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f9c03ff796f05925e62ae0f4fb320e42fa8b7c37 [2019-01-14 04:57:45,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:57:45,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:57:45,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:57:45,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:57:45,189 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:57:45,190 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:45,259 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5226c269/e4d836a1735944d98d7bb9e25193072a/FLAG5fcf5e1c1 [2019-01-14 04:57:45,770 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:57:45,771 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:45,785 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5226c269/e4d836a1735944d98d7bb9e25193072a/FLAG5fcf5e1c1 [2019-01-14 04:57:46,062 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5226c269/e4d836a1735944d98d7bb9e25193072a [2019-01-14 04:57:46,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:57:46,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:57:46,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:46,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:57:46,073 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:57:46,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:46" (1/1) ... [2019-01-14 04:57:46,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3185eb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:46, skipping insertion in model container [2019-01-14 04:57:46,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:46" (1/1) ... [2019-01-14 04:57:46,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:57:46,130 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:57:46,442 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:46,454 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:57:46,501 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:46,562 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:57:46,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:46 WrapperNode [2019-01-14 04:57:46,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:46,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:46,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:57:46,564 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:57:46,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:46" (1/1) ... [2019-01-14 04:57:46,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:46" (1/1) ... [2019-01-14 04:57:46,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:46,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:57:46,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:57:46,687 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:57:46,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:46" (1/1) ... [2019-01-14 04:57:46,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:46" (1/1) ... [2019-01-14 04:57:46,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:46" (1/1) ... [2019-01-14 04:57:46,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:46" (1/1) ... [2019-01-14 04:57:46,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:46" (1/1) ... [2019-01-14 04:57:46,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:46" (1/1) ... [2019-01-14 04:57:46,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:46" (1/1) ... [2019-01-14 04:57:46,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:57:46,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:57:46,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:57:46,734 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:57:46,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:46" (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 04:57:46,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:57:46,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:57:46,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:57:46,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:57:46,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:57:46,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:57:47,168 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:57:47,169 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 04:57:47,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:47 BoogieIcfgContainer [2019-01-14 04:57:47,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:57:47,171 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:57:47,171 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:57:47,175 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:57:47,176 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:47,176 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:57:46" (1/3) ... [2019-01-14 04:57:47,177 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a86cff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:47, skipping insertion in model container [2019-01-14 04:57:47,177 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:47,177 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:46" (2/3) ... [2019-01-14 04:57:47,178 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a86cff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:47, skipping insertion in model container [2019-01-14 04:57:47,178 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:47,178 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:47" (3/3) ... [2019-01-14 04:57:47,180 INFO L375 chiAutomizerObserver]: Analyzing ICFG mult_array-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:47,242 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:57:47,242 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:57:47,242 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:57:47,243 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:57:47,243 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:57:47,243 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:57:47,244 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:57:47,244 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:57:47,244 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:57:47,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 04:57:47,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:57:47,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:47,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:47,284 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:47,284 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:57:47,284 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:57:47,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 04:57:47,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:57:47,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:47,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:47,287 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:47,287 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:57:47,296 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#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; 10#L543true assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 14#L543-2true main_~fac~0 := main_#t~nondet3;havoc main_#t~nondet3; 7#L545true assume !(main_~fac~0 < 1 || main_~fac~0 >= 2147483647 / (4 * main_~length~0)); 11#L545-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; 3#L548true 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; 6#L549-3true [2019-01-14 04:57:47,296 INFO L796 eck$LassoCheckResult]: Loop: 6#L549-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; 5#L549-2true main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 6#L549-3true [2019-01-14 04:57:47,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:47,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815374, now seen corresponding path program 1 times [2019-01-14 04:57:47,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:47,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:47,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:47,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:47,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:47,387 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:57:47,388 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:57:47,388 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 04:57:47,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:47,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:47,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2019-01-14 04:57:47,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:47,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:47,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:47,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:47,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:47,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:47,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1182787760, now seen corresponding path program 1 times [2019-01-14 04:57:47,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:47,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:47,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:47,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:47,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:47,535 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:57:47,535 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:57:47,536 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 04:57:47,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:47,815 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:57:47,950 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:57:48,580 WARN L181 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-01-14 04:57:48,936 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-14 04:57:48,961 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:48,962 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:48,963 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:48,963 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:48,963 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:48,964 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:48,964 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:48,964 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:48,964 INFO L131 ssoRankerPreferences]: Filename of dumped script: mult_array-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-14 04:57:48,964 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:48,965 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:48,994 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 04:57:49,025 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 04:57:49,052 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 04:57:49,080 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 04:57:49,084 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 04:57:49,105 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 04:57:49,109 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 04:57:49,113 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 04:57:49,121 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 04:57:49,127 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 04:57:49,131 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 04:57:49,597 WARN L181 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-01-14 04:57:49,854 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-01-14 04:57:50,237 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 04:57:50,552 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 04:57:50,610 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:50,616 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:50,619 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 04:57:50,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:50,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:50,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:50,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:50,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:50,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:50,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:50,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:50,636 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 04:57:50,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:50,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:50,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:50,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:50,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:50,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:50,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:50,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:50,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 04:57:50,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:50,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:50,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:50,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:50,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:50,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:50,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:50,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:50,648 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 04:57:50,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:50,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:50,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:50,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:50,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:50,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:50,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:50,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:50,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 04:57:50,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:50,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:50,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:50,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:50,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:50,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:50,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:50,664 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 04:57:50,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:50,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:50,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:50,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:50,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:50,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:50,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:50,673 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 04:57:50,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:50,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:50,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:50,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:50,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:50,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:50,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:50,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:50,677 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 04:57:50,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:50,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:50,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:50,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:50,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:50,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:50,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:50,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:50,681 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 04:57:50,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:50,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:50,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:50,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:50,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:50,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:50,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:50,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 04:57:50,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:50,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:50,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:50,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:50,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:50,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:50,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:50,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:50,694 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 04:57:50,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:50,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:50,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:50,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:50,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:50,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:50,819 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:50,896 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 04:57:50,896 INFO L444 ModelExtractionUtils]: 19 out of 28 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-14 04:57:50,902 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:50,906 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:50,906 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:50,910 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-14 04:57:50,958 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-14 04:57:50,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:51,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:51,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:51,049 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 04:57:51,063 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 04:57:51,064 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-01-14 04:57:51,130 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 04:57:51,132 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 04:57:51,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2019-01-14 04:57:51,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 04:57:51,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:51,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 04:57:51,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:51,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 04:57:51,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:51,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2019-01-14 04:57:51,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:57:51,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 17 transitions. [2019-01-14 04:57:51,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 04:57:51,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 04:57:51,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-14 04:57:51,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:51,149 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 04:57:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-14 04:57:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 04:57:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 04:57:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-14 04:57:51,174 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 04:57:51,174 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 04:57:51,174 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:57:51,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-14 04:57:51,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:57:51,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:51,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:51,176 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:51,176 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:57:51,176 INFO L794 eck$LassoCheckResult]: Stem: 135#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#L543 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 136#L543-2 main_~fac~0 := main_#t~nondet3;havoc main_#t~nondet3; 137#L545 assume !(main_~fac~0 < 1 || main_~fac~0 >= 2147483647 / (4 * main_~length~0)); 140#L545-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; 131#L548 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; 132#L549-3 assume !(main_~i~0 < main_~length~0); 138#L549-4 main_~j~0 := 0; 139#L552-3 [2019-01-14 04:57:51,177 INFO L796 eck$LassoCheckResult]: Loop: 139#L552-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; 141#L552-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 139#L552-3 [2019-01-14 04:57:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1182787702, now seen corresponding path program 1 times [2019-01-14 04:57:51,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:51,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:51,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:51,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,182 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:57:51,182 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:57:51,182 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 04:57:51,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:51,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:51,268 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 04:57:51,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:57:51,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:57:51,290 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:57:51,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:51,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2339, now seen corresponding path program 1 times [2019-01-14 04:57:51,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:51,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:51,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:51,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,295 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:57:51,295 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:57:51,295 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 04:57:51,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:51,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:57:51,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:57:51,492 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 04:57:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:57:51,635 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-01-14 04:57:51,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:57:51,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-01-14 04:57:51,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:57:51,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 17 transitions. [2019-01-14 04:57:51,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 04:57:51,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 04:57:51,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-01-14 04:57:51,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:51,640 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-14 04:57:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-01-14 04:57:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-14 04:57:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 04:57:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-01-14 04:57:51,642 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-01-14 04:57:51,642 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-01-14 04:57:51,642 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:57:51,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-01-14 04:57:51,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:57:51,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:51,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:51,645 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:51,645 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:57:51,645 INFO L794 eck$LassoCheckResult]: Stem: 191#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#L543 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 194#L543-2 main_~fac~0 := main_#t~nondet3;havoc main_#t~nondet3; 195#L545 assume !(main_~fac~0 < 1 || main_~fac~0 >= 2147483647 / (4 * main_~length~0)); 197#L545-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; 189#L548 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; 190#L549-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#L549-2 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 193#L549-3 assume !(main_~i~0 < main_~length~0); 196#L549-4 main_~j~0 := 0; 198#L552-3 [2019-01-14 04:57:51,645 INFO L796 eck$LassoCheckResult]: Loop: 198#L552-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; 199#L552-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 198#L552-3 [2019-01-14 04:57:51,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:51,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1507295208, now seen corresponding path program 1 times [2019-01-14 04:57:51,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:51,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:51,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:51,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,649 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:57:51,649 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:57:51,649 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 04:57:51,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:51,711 INFO L82 PathProgramCache]: Analyzing trace with hash 2339, now seen corresponding path program 2 times [2019-01-14 04:57:51,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:51,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:51,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:51,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,715 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:57:51,716 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:57:51,716 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 04:57:51,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:57:51,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 04:57:51,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 04:57:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:51,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:51,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1106714758, now seen corresponding path program 1 times [2019-01-14 04:57:51,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:51,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:51,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:51,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,765 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:57:51,765 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:57:51,765 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 04:57:51,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:52,367 WARN L181 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-01-14 04:57:52,484 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-01-14 04:57:52,487 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:52,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:52,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:52,487 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:52,487 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:52,488 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:52,488 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:52,488 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:52,488 INFO L131 ssoRankerPreferences]: Filename of dumped script: mult_array-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-14 04:57:52,488 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:52,489 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:52,494 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 04:57:52,514 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 04:57:52,516 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 04:57:52,538 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 04:57:52,542 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 04:57:52,544 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 04:57:52,548 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 04:57:52,551 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 04:57:53,269 WARN L181 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 65 [2019-01-14 04:57:53,434 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-01-14 04:57:53,435 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 04:57:53,440 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 04:57:53,727 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-01-14 04:57:54,019 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 48 [2019-01-14 04:57:54,342 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 04:57:54,581 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 04:57:54,627 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:54,627 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:54,628 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 04:57:54,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:54,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:54,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:54,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:54,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:54,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:54,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:54,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:54,631 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 04:57:54,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:54,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:54,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:54,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:54,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:54,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:54,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:54,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:54,633 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 04:57:54,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:54,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:54,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:54,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:54,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:54,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:54,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:54,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:54,636 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 04:57:54,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:54,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:54,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:54,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:54,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:54,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:54,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:54,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:54,638 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 04:57:54,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:54,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:54,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:54,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:54,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:54,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:54,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:54,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:54,640 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 04:57:54,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:54,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:54,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:54,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:54,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:54,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:54,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:54,645 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 04:57:54,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:54,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:54,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:54,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:54,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:54,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:54,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:54,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:54,648 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 04:57:54,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:54,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:54,649 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:57:54,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:54,666 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 04:57:54,666 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 04:57:54,828 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:55,031 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 04:57:55,032 INFO L444 ModelExtractionUtils]: 53 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 04:57:55,032 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:55,035 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-14 04:57:55,035 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:55,035 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 04:57:55,320 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-14 04:57:55,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:57:55,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:55,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:55,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:55,570 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 04:57:55,571 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 04:57:55,571 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 04:57:55,585 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 04:57:55,589 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 04:57:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-14 04:57:55,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 04:57:55,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:55,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-14 04:57:55,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:55,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-14 04:57:55,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:55,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-01-14 04:57:55,592 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:55,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2019-01-14 04:57:55,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:57:55,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:57:55,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:57:55,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:55,593 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:55,593 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:55,594 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:55,594 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:57:55,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:57:55,594 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:55,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:57:55,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:57:55 BoogieIcfgContainer [2019-01-14 04:57:55,600 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:57:55,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:57:55,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:57:55,601 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:57:55,601 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:47" (3/4) ... [2019-01-14 04:57:55,605 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:57:55,605 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:57:55,606 INFO L168 Benchmark]: Toolchain (without parser) took 9539.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 952.7 MB in the beginning and 854.8 MB in the end (delta: 97.9 MB). Peak memory consumption was 309.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:55,607 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-14 04:57:55,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 494.26 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:55,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:55,610 INFO L168 Benchmark]: Boogie Preprocessor took 46.82 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 04:57:55,610 INFO L168 Benchmark]: RCFGBuilder took 436.35 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: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:55,611 INFO L168 Benchmark]: BuchiAutomizer took 8429.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 854.8 MB in the end (delta: 246.7 MB). Peak memory consumption was 325.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:55,612 INFO L168 Benchmark]: Witness Printer took 4.68 ms. Allocated memory is still 1.2 GB. Free memory is still 854.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:57:55,617 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 494.26 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 122.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.82 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 436.35 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: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8429.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 854.8 MB in the end (delta: 246.7 MB). Peak memory consumption was 325.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.68 ms. Allocated memory is still 1.2 GB. Free memory is still 854.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 * 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 * i + length 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 8.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 7.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. 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: 38 SDtfs, 41 SDslu, 15 SDs, 0 SdLazy, 33 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital218 mio100 ax100 hnf98 lsp94 ukn87 mio100 lsp67 div151 bol100 ite131 ukn100 eq137 hnf94 smp57 dnf117 smp97 tf100 neg99 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 387ms 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...