./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f9c03ff796f05925e62ae0f4fb320e42fa8b7c37 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 14:23:49,093 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:23:49,094 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:23:49,100 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:23:49,100 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:23:49,101 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:23:49,101 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:23:49,102 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:23:49,104 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:23:49,104 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:23:49,105 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:23:49,105 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:23:49,105 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:23:49,106 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:23:49,107 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:23:49,107 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:23:49,107 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:23:49,108 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:23:49,109 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:23:49,110 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:23:49,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:23:49,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:23:49,112 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:23:49,112 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:23:49,112 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:23:49,113 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:23:49,114 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:23:49,114 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:23:49,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:23:49,115 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:23:49,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:23:49,115 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:23:49,115 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:23:49,116 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:23:49,116 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:23:49,116 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:23:49,117 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 14:23:49,124 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:23:49,124 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:23:49,125 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:23:49,125 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:23:49,125 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:23:49,125 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 14:23:49,125 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 14:23:49,125 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 14:23:49,125 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 14:23:49,125 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 14:23:49,126 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 14:23:49,126 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:23:49,126 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:23:49,126 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 14:23:49,126 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:23:49,126 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:23:49,126 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:23:49,126 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 14:23:49,126 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 14:23:49,127 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 14:23:49,127 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:23:49,127 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:23:49,127 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 14:23:49,127 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:23:49,127 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 14:23:49,127 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:23:49,127 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:23:49,127 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 14:23:49,128 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:23:49,128 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:23:49,128 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 14:23:49,128 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 14:23:49,128 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f9c03ff796f05925e62ae0f4fb320e42fa8b7c37 [2018-11-18 14:23:49,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:23:49,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:23:49,160 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:23:49,161 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:23:49,162 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:23:49,162 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i [2018-11-18 14:23:49,206 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/data/a46eb2a21/f63848aa17f2465ea4da4ae3cb84b46c/FLAG2fb67c7f0 [2018-11-18 14:23:49,566 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:23:49,566 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/sv-benchmarks/c/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i [2018-11-18 14:23:49,575 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/data/a46eb2a21/f63848aa17f2465ea4da4ae3cb84b46c/FLAG2fb67c7f0 [2018-11-18 14:23:49,982 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/data/a46eb2a21/f63848aa17f2465ea4da4ae3cb84b46c [2018-11-18 14:23:49,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:23:49,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:23:49,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:23:49,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:23:49,989 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:23:49,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:23:49" (1/1) ... [2018-11-18 14:23:49,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709bd6c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:49, skipping insertion in model container [2018-11-18 14:23:49,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:23:49" (1/1) ... [2018-11-18 14:23:49,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:23:50,028 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:23:50,216 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:23:50,223 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:23:50,251 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:23:50,316 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:23:50,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:50 WrapperNode [2018-11-18 14:23:50,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:23:50,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:23:50,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:23:50,317 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:23:50,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:50" (1/1) ... [2018-11-18 14:23:50,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:50" (1/1) ... [2018-11-18 14:23:50,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:23:50,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:23:50,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:23:50,344 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:23:50,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:50" (1/1) ... [2018-11-18 14:23:50,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:50" (1/1) ... [2018-11-18 14:23:50,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:50" (1/1) ... [2018-11-18 14:23:50,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:50" (1/1) ... [2018-11-18 14:23:50,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:50" (1/1) ... [2018-11-18 14:23:50,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:50" (1/1) ... [2018-11-18 14:23:50,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:50" (1/1) ... [2018-11-18 14:23:50,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:23:50,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:23:50,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:23:50,358 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:23:50,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:23:50,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 14:23:50,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 14:23:50,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 14:23:50,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 14:23:50,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:23:50,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:23:50,532 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:23:50,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:23:50 BoogieIcfgContainer [2018-11-18 14:23:50,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:23:50,533 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 14:23:50,533 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 14:23:50,536 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 14:23:50,537 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:23:50,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 02:23:49" (1/3) ... [2018-11-18 14:23:50,538 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d465b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:23:50, skipping insertion in model container [2018-11-18 14:23:50,538 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:23:50,538 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:23:50" (2/3) ... [2018-11-18 14:23:50,538 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d465b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:23:50, skipping insertion in model container [2018-11-18 14:23:50,538 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:23:50,538 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:23:50" (3/3) ... [2018-11-18 14:23:50,540 INFO L375 chiAutomizerObserver]: Analyzing ICFG mult_array-alloca_true-valid-memsafety_true-termination.i [2018-11-18 14:23:50,577 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:23:50,577 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 14:23:50,577 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 14:23:50,577 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 14:23:50,577 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:23:50,577 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:23:50,578 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 14:23:50,578 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:23:50,578 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 14:23:50,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 14:23:50,600 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 14:23:50,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:23:50,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:23:50,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:23:50,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:23:50,606 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 14:23:50,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 14:23:50,607 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 14:23:50,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:23:50,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:23:50,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:23:50,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:23:50,612 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 12#L543true assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 16#L543-2true main_~fac~0 := main_#t~nondet3;havoc main_#t~nondet3; 8#L545true assume !(main_~fac~0 < 1 || main_~fac~0 >= 2147483647 / (4 * main_~length~0)); 13#L545-2true call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(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.alloc(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; 9#L549-4true [2018-11-18 14:23:50,612 INFO L796 eck$LassoCheckResult]: Loop: 9#L549-4true assume true; 4#L549-1true 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; 7#L549-3true main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 9#L549-4true [2018-11-18 14:23:50,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:23:50,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815374, now seen corresponding path program 1 times [2018-11-18 14:23:50,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:23:50,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:23:50,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:50,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:23:50,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:50,668 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 14:23:50,668 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 14:23:50,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/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 [2018-11-18 14:23:50,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:23:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:23:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:23:50,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:23:50,731 INFO L82 PathProgramCache]: Analyzing trace with hash 54778, now seen corresponding path program 1 times [2018-11-18 14:23:50,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:23:50,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:23:50,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:50,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:23:50,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:23:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:23:50,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:23:50,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1988288947, now seen corresponding path program 1 times [2018-11-18 14:23:50,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:23:50,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:23:50,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:50,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:23:50,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:50,756 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 14:23:50,756 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 14:23:50,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/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 [2018-11-18 14:23:50,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:23:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:23:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:23:51,000 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-11-18 14:23:51,059 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:23:51,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:23:51,060 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:23:51,060 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:23:51,060 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:23:51,060 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:23:51,061 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:23:51,061 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:23:51,061 INFO L131 ssoRankerPreferences]: Filename of dumped script: mult_array-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-18 14:23:51,061 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:23:51,061 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:23:51,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:51,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:51,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:51,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:51,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:51,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:51,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:51,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:51,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:51,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:51,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:51,495 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:23:51,498 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:23:51,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:23:51,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:51,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:23:51,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:23:51,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:23:51,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:51,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:23:51,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:23:51,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:23:51,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:51,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:23:51,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:23:51,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:23:51,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:51,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:23:51,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:23:51,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:23:51,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:51,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:23:51,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:23:51,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:51,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:23:51,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:23:51,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:51,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:23:51,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:23:51,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:23:51,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:51,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:23:51,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:23:51,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:51,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:23:51,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:23:51,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:23:51,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:51,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:23:51,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:23:51,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,544 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:23:51,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,546 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:23:51,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:23:51,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,560 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:23:51,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,562 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:23:51,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:23:51,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:23:51,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:51,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:23:51,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:23:51,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:51,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:23:51,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:23:51,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:51,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:23:51,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:23:51,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:51,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:23:51,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:23:51,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:51,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:51,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:51,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:51,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:51,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:51,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:23:51,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:23:51,630 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:23:51,662 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 14:23:51,662 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 14:23:51,664 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:23:51,666 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:23:51,666 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:23:51,667 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2018-11-18 14:23:51,695 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-18 14:23:51,702 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 14:23:51,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:23:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:23:51,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:23:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:23:51,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:23:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:23:51,768 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 14:23:51,769 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-11-18 14:23:51,813 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 40 states and 49 transitions. Complement of second has 7 states. [2018-11-18 14:23:51,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 14:23:51,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:23:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-18 14:23:51,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-18 14:23:51,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:23:51,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-18 14:23:51,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:23:51,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-18 14:23:51,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:23:51,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2018-11-18 14:23:51,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:23:51,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 16 states and 20 transitions. [2018-11-18 14:23:51,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 14:23:51,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 14:23:51,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-18 14:23:51,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:23:51,823 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-18 14:23:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-18 14:23:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-18 14:23:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 14:23:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-18 14:23:51,840 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-18 14:23:51,840 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-18 14:23:51,840 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 14:23:51,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-18 14:23:51,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:23:51,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:23:51,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:23:51,841 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:23:51,842 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:23:51,842 INFO L794 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 150#L543 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 151#L543-2 main_~fac~0 := main_#t~nondet3;havoc main_#t~nondet3; 148#L545 assume !(main_~fac~0 < 1 || main_~fac~0 >= 2147483647 / (4 * main_~length~0)); 149#L545-2 call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(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.alloc(4 * (main_~fac~0 * main_~length~0));main_~arr2~0.base, main_~arr2~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 145#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; 146#L549-4 assume true; 139#L549-1 assume !(main_~i~0 < main_~length~0); 140#L549-5 main_~j~0 := 0; 143#L552-4 [2018-11-18 14:23:51,842 INFO L796 eck$LassoCheckResult]: Loop: 143#L552-4 assume true; 144#L552-1 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; 154#L552-3 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 143#L552-4 [2018-11-18 14:23:51,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:23:51,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1988289005, now seen corresponding path program 1 times [2018-11-18 14:23:51,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:23:51,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:23:51,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:51,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:23:51,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:51,845 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 14:23:51,845 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 14:23:51,845 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/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 [2018-11-18 14:23:51,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:23:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:23:51,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:23:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:23:51,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:23:51,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:23:51,896 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:23:51,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:23:51,897 INFO L82 PathProgramCache]: Analyzing trace with hash 69673, now seen corresponding path program 1 times [2018-11-18 14:23:51,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:23:51,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:23:51,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:51,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:23:51,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:51,899 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 14:23:51,899 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 14:23:51,899 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/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 [2018-11-18 14:23:51,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:23:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:23:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:23:51,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:23:51,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:23:51,991 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-18 14:23:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:23:52,013 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-11-18 14:23:52,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:23:52,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2018-11-18 14:23:52,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:23:52,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 21 transitions. [2018-11-18 14:23:52,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 14:23:52,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 14:23:52,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-18 14:23:52,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:23:52,015 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-18 14:23:52,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-18 14:23:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-18 14:23:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 14:23:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-18 14:23:52,017 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-18 14:23:52,017 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-18 14:23:52,017 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 14:23:52,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-18 14:23:52,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:23:52,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:23:52,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:23:52,018 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:23:52,018 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:23:52,018 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 219#L543 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 220#L543-2 main_~fac~0 := main_#t~nondet3;havoc main_#t~nondet3; 217#L545 assume !(main_~fac~0 < 1 || main_~fac~0 >= 2147483647 / (4 * main_~length~0)); 218#L545-2 call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(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.alloc(4 * (main_~fac~0 * main_~length~0));main_~arr2~0.base, main_~arr2~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 208#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; 209#L549-4 assume true; 212#L549-1 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; 213#L549-3 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 216#L549-4 assume true; 210#L549-1 assume !(main_~i~0 < main_~length~0); 211#L549-5 main_~j~0 := 0; 214#L552-4 [2018-11-18 14:23:52,018 INFO L796 eck$LassoCheckResult]: Loop: 214#L552-4 assume true; 215#L552-1 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; 223#L552-3 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 214#L552-4 [2018-11-18 14:23:52,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:23:52,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1222016012, now seen corresponding path program 1 times [2018-11-18 14:23:52,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:23:52,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:23:52,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:52,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:23:52,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:52,021 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 14:23:52,021 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 14:23:52,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/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 [2018-11-18 14:23:52,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:23:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:23:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:23:52,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:23:52,069 INFO L82 PathProgramCache]: Analyzing trace with hash 69673, now seen corresponding path program 2 times [2018-11-18 14:23:52,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:23:52,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:23:52,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:52,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:23:52,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:52,071 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 14:23:52,071 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 14:23:52,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/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 [2018-11-18 14:23:52,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 14:23:52,083 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 14:23:52,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 14:23:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:23:52,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:23:52,111 INFO L82 PathProgramCache]: Analyzing trace with hash -936172714, now seen corresponding path program 1 times [2018-11-18 14:23:52,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:23:52,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:23:52,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:52,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:23:52,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:23:52,114 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 14:23:52,114 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 14:23:52,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36af46d8-823b-430a-a3d0-26a0b4ab2a28/bin-2019/uautomizer/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 [2018-11-18 14:23:52,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:23:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:23:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:23:52,364 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2018-11-18 14:23:52,461 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:23:52,461 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:23:52,461 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:23:52,462 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:23:52,462 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:23:52,462 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:23:52,462 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:23:52,462 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:23:52,462 INFO L131 ssoRankerPreferences]: Filename of dumped script: mult_array-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-18 14:23:52,462 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:23:52,462 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:23:52,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:52,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:52,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:52,762 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2018-11-18 14:23:52,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:52,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:52,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:52,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:52,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:52,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:52,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:23:53,005 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2018-11-18 14:23:53,182 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 48 [2018-11-18 14:23:53,388 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:23:53,388 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:23:53,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:53,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:53,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:23:53,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:53,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:53,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:53,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:23:53,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:23:53,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:53,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:53,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:53,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:23:53,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:53,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:23:53,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:53,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:23:53,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:23:53,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:23:53,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:23:53,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:23:53,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:23:53,393 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:23:53,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:23:53,399 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 14:23:53,399 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 14:23:53,498 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:23:53,521 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 14:23:53,521 INFO L444 ModelExtractionUtils]: 61 out of 66 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 14:23:53,522 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:23:53,523 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-18 14:23:53,523 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:23:53,523 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 [] [2018-11-18 14:23:53,553 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 14:23:53,554 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 14:23:53,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:23:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:23:53,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:23:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:23:53,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:23:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:23:53,591 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 14:23:53,591 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-18 14:23:53,599 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 19 states and 23 transitions. Complement of second has 6 states. [2018-11-18 14:23:53,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 14:23:53,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:23:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-18 14:23:53,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-18 14:23:53,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:23:53,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-18 14:23:53,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:23:53,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-18 14:23:53,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:23:53,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2018-11-18 14:23:53,602 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 14:23:53,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2018-11-18 14:23:53,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 14:23:53,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 14:23:53,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 14:23:53,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:23:53,602 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:23:53,602 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:23:53,602 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:23:53,602 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 14:23:53,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:23:53,602 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 14:23:53,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 14:23:53,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 02:23:53 BoogieIcfgContainer [2018-11-18 14:23:53,607 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 14:23:53,607 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:23:53,607 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:23:53,607 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:23:53,607 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:23:50" (3/4) ... [2018-11-18 14:23:53,609 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 14:23:53,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:23:53,610 INFO L168 Benchmark]: Toolchain (without parser) took 3625.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 956.4 MB in the beginning and 893.4 MB in the end (delta: 63.1 MB). Peak memory consumption was 272.8 MB. Max. memory is 11.5 GB. [2018-11-18 14:23:53,610 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:23:53,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-11-18 14:23:53,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.26 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:23:53,612 INFO L168 Benchmark]: Boogie Preprocessor took 13.50 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:23:53,612 INFO L168 Benchmark]: RCFGBuilder took 174.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:23:53,612 INFO L168 Benchmark]: BuchiAutomizer took 3073.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 893.4 MB in the end (delta: 205.9 MB). Peak memory consumption was 283.0 MB. Max. memory is 11.5 GB. [2018-11-18 14:23:53,613 INFO L168 Benchmark]: Witness Printer took 2.62 ms. Allocated memory is still 1.2 GB. Free memory is still 893.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:23:53,615 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.26 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.50 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 174.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3073.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 893.4 MB in the end (delta: 205.9 MB). Peak memory consumption was 283.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.62 ms. Allocated memory is still 1.2 GB. Free memory is still 893.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has affine ranking function -4 * j + unknown-#length-unknown[arr2] + -1 * arr2 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 45 SDtfs, 47 SDslu, 25 SDs, 0 SdLazy, 30 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital212 mio100 ax100 hnf98 lsp94 ukn89 mio100 lsp71 div158 bol100 ite166 ukn100 eq135 hnf94 smp51 dnf111 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 130ms VariablesStem: 14 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...