./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/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 dc8491de7bb3fbae410adb8e5711b9887b8c9c8f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 01:08:09,117 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:08:09,117 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:08:09,123 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:08:09,124 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:08:09,124 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:08:09,125 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:08:09,125 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:08:09,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:08:09,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:08:09,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:08:09,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:08:09,128 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:08:09,128 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:08:09,129 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:08:09,129 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:08:09,129 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:08:09,130 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:08:09,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:08:09,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:08:09,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:08:09,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:08:09,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:08:09,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:08:09,134 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:08:09,134 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:08:09,135 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:08:09,135 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:08:09,136 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:08:09,136 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:08:09,136 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:08:09,137 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:08:09,137 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:08:09,137 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:08:09,137 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:08:09,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:08:09,138 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 01:08:09,145 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:08:09,145 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:08:09,146 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 01:08:09,146 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 01:08:09,146 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 01:08:09,146 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 01:08:09,146 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 01:08:09,147 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 01:08:09,147 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 01:08:09,147 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 01:08:09,147 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 01:08:09,147 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:08:09,147 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:08:09,147 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 01:08:09,147 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:08:09,147 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:08:09,147 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:08:09,147 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 01:08:09,147 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 01:08:09,148 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 01:08:09,148 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:08:09,148 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 01:08:09,148 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 01:08:09,148 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 01:08:09,148 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 01:08:09,148 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:08:09,148 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:08:09,148 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 01:08:09,148 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:08:09,148 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 01:08:09,149 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 01:08:09,149 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 01:08:09,149 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_f56903f1-4476-4639-a8bc-33bcce4e7960/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 -> dc8491de7bb3fbae410adb8e5711b9887b8c9c8f [2018-12-02 01:08:09,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:08:09,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:08:09,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:08:09,175 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:08:09,175 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:08:09,176 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-12-02 01:08:09,210 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/bin-2019/uautomizer/data/5410d5055/b711ddb2e19045c3a69c982d1b94ccdc/FLAG49df13217 [2018-12-02 01:08:09,510 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:08:09,510 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-12-02 01:08:09,517 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/bin-2019/uautomizer/data/5410d5055/b711ddb2e19045c3a69c982d1b94ccdc/FLAG49df13217 [2018-12-02 01:08:09,525 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/bin-2019/uautomizer/data/5410d5055/b711ddb2e19045c3a69c982d1b94ccdc [2018-12-02 01:08:09,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:08:09,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:08:09,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:08:09,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:08:09,530 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:08:09,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:08:09" (1/1) ... [2018-12-02 01:08:09,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c7f9d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:09, skipping insertion in model container [2018-12-02 01:08:09,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:08:09" (1/1) ... [2018-12-02 01:08:09,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:08:09,554 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:08:09,692 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:08:09,698 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:08:09,755 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:08:09,775 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:08:09,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:09 WrapperNode [2018-12-02 01:08:09,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:08:09,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 01:08:09,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 01:08:09,776 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 01:08:09,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:09" (1/1) ... [2018-12-02 01:08:09,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:09" (1/1) ... [2018-12-02 01:08:09,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 01:08:09,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:08:09,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:08:09,801 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:08:09,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:09" (1/1) ... [2018-12-02 01:08:09,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:09" (1/1) ... [2018-12-02 01:08:09,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:09" (1/1) ... [2018-12-02 01:08:09,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:09" (1/1) ... [2018-12-02 01:08:09,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:09" (1/1) ... [2018-12-02 01:08:09,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:09" (1/1) ... [2018-12-02 01:08:09,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:09" (1/1) ... [2018-12-02 01:08:09,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:08:09,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:08:09,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:08:09,816 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:08:09,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/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-12-02 01:08:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 01:08:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 01:08:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 01:08:09,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 01:08:09,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:08:09,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:08:09,963 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:08:09,963 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 01:08:09,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:08:09 BoogieIcfgContainer [2018-12-02 01:08:09,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:08:09,963 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 01:08:09,964 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 01:08:09,966 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 01:08:09,966 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 01:08:09,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 01:08:09" (1/3) ... [2018-12-02 01:08:09,967 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e4f90fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 01:08:09, skipping insertion in model container [2018-12-02 01:08:09,967 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 01:08:09,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:09" (2/3) ... [2018-12-02 01:08:09,967 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e4f90fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 01:08:09, skipping insertion in model container [2018-12-02 01:08:09,968 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 01:08:09,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:08:09" (3/3) ... [2018-12-02 01:08:09,969 INFO L375 chiAutomizerObserver]: Analyzing ICFG array03-alloca_true-valid-memsafety_true-termination.i [2018-12-02 01:08:10,000 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 01:08:10,001 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 01:08:10,001 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 01:08:10,001 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 01:08:10,001 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:08:10,001 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:08:10,001 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 01:08:10,001 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:08:10,001 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 01:08:10,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-02 01:08:10,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 01:08:10,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:08:10,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:08:10,029 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 01:08:10,029 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 01:08:10,030 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 01:08:10,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-02 01:08:10,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 01:08:10,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:08:10,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:08:10,031 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 01:08:10,031 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 01:08:10,036 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 15#L560true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 5#L560-2true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 11#L544-3true [2018-12-02 01:08:10,036 INFO L796 eck$LassoCheckResult]: Loop: 11#L544-3true assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 7#L546true assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 17#L551-2true assume !true; 4#L551-3true call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 9#L544-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 11#L544-3true [2018-12-02 01:08:10,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:10,040 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-02 01:08:10,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:10,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:10,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:10,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:10,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:10,110 INFO L82 PathProgramCache]: Analyzing trace with hash 44963621, now seen corresponding path program 1 times [2018-12-02 01:08:10,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:10,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:10,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:10,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:08:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:08:10,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:08:10,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 01:08:10,136 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 01:08:10,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 01:08:10,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 01:08:10,146 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-12-02 01:08:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:08:10,151 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-12-02 01:08:10,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 01:08:10,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-12-02 01:08:10,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 01:08:10,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2018-12-02 01:08:10,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 01:08:10,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 01:08:10,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2018-12-02 01:08:10,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 01:08:10,156 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-12-02 01:08:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2018-12-02 01:08:10,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-02 01:08:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-02 01:08:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-12-02 01:08:10,173 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-12-02 01:08:10,173 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-12-02 01:08:10,173 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 01:08:10,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-12-02 01:08:10,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 01:08:10,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:08:10,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:08:10,174 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 01:08:10,174 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 01:08:10,174 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 40#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 41#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 45#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 44#L544-3 [2018-12-02 01:08:10,175 INFO L796 eck$LassoCheckResult]: Loop: 44#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 47#L546 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 43#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 48#L551 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 38#L551-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 39#L544-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 44#L544-3 [2018-12-02 01:08:10,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:10,175 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-12-02 01:08:10,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:10,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:10,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:10,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:10,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:10,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1393657929, now seen corresponding path program 1 times [2018-12-02 01:08:10,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:10,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:10,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:08:10,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:10,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:10,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1898369747, now seen corresponding path program 1 times [2018-12-02 01:08:10,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:10,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:10,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:10,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:10,356 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 01:08:10,357 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 01:08:10,357 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 01:08:10,357 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 01:08:10,357 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 01:08:10,357 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:08:10,358 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 01:08:10,358 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 01:08:10,358 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-02 01:08:10,358 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 01:08:10,358 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 01:08:10,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:10,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:10,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:10,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:10,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:10,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:10,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:10,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:10,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:10,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:10,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:10,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:10,637 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 01:08:10,640 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 01:08:10,641 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-12-02 01:08:10,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:10,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:08:10,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:10,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:10,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:10,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:08:10,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:08:10,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:10,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:08:10,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:10,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:08:10,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:10,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:10,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:10,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:08:10,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:08:10,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:10,649 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-12-02 01:08:10,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:10,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:08:10,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:10,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:10,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:10,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:08:10,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:08:10,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:10,651 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-12-02 01:08:10,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:10,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:08:10,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:10,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:10,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:10,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:08:10,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:08:10,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:10,655 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-12-02 01:08:10,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:10,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:08:10,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:10,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:10,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:10,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:08:10,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:08:10,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:10,658 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-12-02 01:08:10,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:10,658 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 01:08:10,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:10,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:10,661 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 01:08:10,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:08:10,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:10,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:08:10,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:10,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:10,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:10,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:10,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:08:10,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:08:10,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:10,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:08:10,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:10,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:10,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:10,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:10,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:08:10,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:08:10,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:10,686 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-12-02 01:08:10,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:10,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:10,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:10,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:10,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:08:10,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:08:10,718 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 01:08:10,738 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 01:08:10,738 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 01:08:10,739 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 01:08:10,740 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 01:08:10,741 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 01:08:10,741 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-12-02 01:08:10,751 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 01:08:10,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:08:10,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:08:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:08:10,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:08:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:08:10,826 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-12-02 01:08:10,826 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 01:08:10,865 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 18 states and 26 transitions. Complement of second has 4 states. [2018-12-02 01:08:10,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 01:08:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 01:08:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-02 01:08:10,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2018-12-02 01:08:10,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:08:10,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-02 01:08:10,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:08:10,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 12 letters. [2018-12-02 01:08:10,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:08:10,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 26 transitions. [2018-12-02 01:08:10,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 01:08:10,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 24 transitions. [2018-12-02 01:08:10,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-02 01:08:10,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 01:08:10,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2018-12-02 01:08:10,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 01:08:10,870 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-12-02 01:08:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2018-12-02 01:08:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-02 01:08:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-02 01:08:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-12-02 01:08:10,871 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-12-02 01:08:10,871 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-12-02 01:08:10,871 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 01:08:10,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2018-12-02 01:08:10,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 01:08:10,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:08:10,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:08:10,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 01:08:10,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 01:08:10,873 INFO L794 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 129#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 130#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 137#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 138#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 142#L546 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 132#L551-2 [2018-12-02 01:08:10,873 INFO L796 eck$LassoCheckResult]: Loop: 132#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 143#L551 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 132#L551-2 [2018-12-02 01:08:10,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:10,873 INFO L82 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2018-12-02 01:08:10,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:10,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:10,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:10,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:10,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:10,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2018-12-02 01:08:10,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:10,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:10,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:10,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,891 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 01:08:10,891 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 01:08:10,891 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/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-12-02 01:08:10,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:10,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:10,932 INFO L82 PathProgramCache]: Analyzing trace with hash 176795341, now seen corresponding path program 1 times [2018-12-02 01:08:10,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:10,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:10,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:10,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:10,938 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 01:08:10,939 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 01:08:10,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/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-12-02 01:08:10,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:08:10,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:08:10,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-02 01:08:10,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-12-02 01:08:10,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:08:10,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:08:10,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:08:10,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-12-02 01:08:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:08:11,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:08:11,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:08:11,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:08:11,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:08:11,049 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-02 01:08:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:08:11,078 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-12-02 01:08:11,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:08:11,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-02 01:08:11,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 01:08:11,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2018-12-02 01:08:11,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 01:08:11,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 01:08:11,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2018-12-02 01:08:11,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 01:08:11,080 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-12-02 01:08:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2018-12-02 01:08:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-02 01:08:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 01:08:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-12-02 01:08:11,082 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 01:08:11,082 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 01:08:11,082 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 01:08:11,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-12-02 01:08:11,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 01:08:11,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:08:11,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:08:11,083 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:08:11,083 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 01:08:11,084 INFO L794 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 201#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 202#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 208#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 209#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 212#L546 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 203#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 204#L551-2 [2018-12-02 01:08:11,084 INFO L796 eck$LassoCheckResult]: Loop: 204#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 214#L551 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 204#L551-2 [2018-12-02 01:08:11,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:11,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-12-02 01:08:11,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:11,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:11,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:11,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:11,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:11,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 2 times [2018-12-02 01:08:11,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:11,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:11,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,101 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 01:08:11,101 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 01:08:11,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/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-12-02 01:08:11,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 01:08:11,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-02 01:08:11,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 01:08:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:11,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:11,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1185742934, now seen corresponding path program 1 times [2018-12-02 01:08:11,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:11,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:11,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:08:11,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,137 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 01:08:11,137 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 01:08:11,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/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-12-02 01:08:11,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:11,344 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 01:08:11,344 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 01:08:11,344 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 01:08:11,345 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 01:08:11,345 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 01:08:11,345 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:08:11,345 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 01:08:11,345 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 01:08:11,345 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-12-02 01:08:11,345 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 01:08:11,345 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 01:08:11,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:11,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:11,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:11,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:11,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:11,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:11,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:11,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:11,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:11,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:11,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:11,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:11,597 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 01:08:11,597 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 01:08:11,597 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-12-02 01:08:11,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:11,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:08:11,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:11,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:11,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:11,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:08:11,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:08:11,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:11,600 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-12-02 01:08:11,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:11,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:08:11,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:11,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:11,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:11,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:08:11,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:08:11,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:11,601 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-12-02 01:08:11,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:11,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:08:11,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:11,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:11,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:11,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:08:11,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:08:11,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:11,602 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-12-02 01:08:11,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:11,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:11,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:11,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:11,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:08:11,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:08:11,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:11,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:08:11,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:11,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:08:11,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:11,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:11,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:11,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:08:11,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:08:11,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:11,607 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-12-02 01:08:11,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:11,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:11,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:11,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:11,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:08:11,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:08:11,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:11,621 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-12-02 01:08:11,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:11,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:11,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:11,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:11,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:08:11,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:08:11,629 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 01:08:11,631 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 01:08:11,631 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 01:08:11,632 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 01:08:11,633 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 01:08:11,633 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 01:08:11,633 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-12-02 01:08:11,638 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 01:08:11,639 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 01:08:11,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:08:11,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:08:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:08:11,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:08:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:08:11,683 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-12-02 01:08:11,683 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-02 01:08:11,696 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 54 transitions. Complement of second has 7 states. [2018-12-02 01:08:11,696 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-12-02 01:08:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 01:08:11,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 01:08:11,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-02 01:08:11,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:08:11,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-02 01:08:11,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:08:11,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-02 01:08:11,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:08:11,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2018-12-02 01:08:11,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 01:08:11,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 47 transitions. [2018-12-02 01:08:11,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-02 01:08:11,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-02 01:08:11,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2018-12-02 01:08:11,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 01:08:11,698 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-12-02 01:08:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2018-12-02 01:08:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-12-02 01:08:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 01:08:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-12-02 01:08:11,700 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-12-02 01:08:11,700 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-12-02 01:08:11,700 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 01:08:11,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2018-12-02 01:08:11,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 01:08:11,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:08:11,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:08:11,701 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:08:11,701 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 01:08:11,701 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 320#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 321#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 328#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 329#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 333#L546 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 322#L548 assume test_fun_#t~mem4 < 0;havoc test_fun_#t~mem4;test_fun_~res~0 := 0; 323#L551-2 [2018-12-02 01:08:11,701 INFO L796 eck$LassoCheckResult]: Loop: 323#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 337#L551 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 323#L551-2 [2018-12-02 01:08:11,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2018-12-02 01:08:11,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:11,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:11,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:11,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:11,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:11,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 3 times [2018-12-02 01:08:11,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:11,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:11,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:11,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,713 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 01:08:11,714 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 01:08:11,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/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-12-02 01:08:11,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 01:08:11,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 01:08:11,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 01:08:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:11,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:11,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741012, now seen corresponding path program 1 times [2018-12-02 01:08:11,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:11,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:11,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:08:11,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,742 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 01:08:11,742 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 01:08:11,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/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-12-02 01:08:11,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:08:11,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:08:11,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-02 01:08:11,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-12-02 01:08:11,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:08:11,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:08:11,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:08:11,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-12-02 01:08:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:08:11,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:08:11,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:08:11,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:08:11,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:08:11,837 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-12-02 01:08:11,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:08:11,864 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-12-02 01:08:11,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:08:11,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2018-12-02 01:08:11,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 01:08:11,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 41 transitions. [2018-12-02 01:08:11,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 01:08:11,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 01:08:11,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-12-02 01:08:11,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 01:08:11,866 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-02 01:08:11,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-12-02 01:08:11,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-12-02 01:08:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 01:08:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-02 01:08:11,868 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-02 01:08:11,868 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-02 01:08:11,868 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 01:08:11,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2018-12-02 01:08:11,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 01:08:11,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:08:11,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:08:11,869 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:08:11,869 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 01:08:11,869 INFO L794 eck$LassoCheckResult]: Stem: 436#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 424#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 425#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 433#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 434#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 437#L546 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 440#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 443#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 444#L551 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 448#L551-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 447#L544-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 445#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 438#L546 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 426#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 427#L551-2 [2018-12-02 01:08:11,869 INFO L796 eck$LassoCheckResult]: Loop: 427#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 441#L551 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 427#L551-2 [2018-12-02 01:08:11,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:11,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1864345184, now seen corresponding path program 1 times [2018-12-02 01:08:11,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:11,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:11,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:11,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:08:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:08:11,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:08:11,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:08:11,920 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 01:08:11,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:11,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 4 times [2018-12-02 01:08:11,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:11,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:11,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:11,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:11,922 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 01:08:11,923 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 01:08:11,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/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-12-02 01:08:11,930 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 01:08:11,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 01:08:11,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 01:08:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:11,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:08:11,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:08:11,971 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-12-02 01:08:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:08:12,011 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2018-12-02 01:08:12,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:08:12,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2018-12-02 01:08:12,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 01:08:12,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2018-12-02 01:08:12,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 01:08:12,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 01:08:12,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-12-02 01:08:12,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 01:08:12,013 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-02 01:08:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-12-02 01:08:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-12-02 01:08:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 01:08:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-12-02 01:08:12,014 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-12-02 01:08:12,014 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-12-02 01:08:12,014 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 01:08:12,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2018-12-02 01:08:12,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 01:08:12,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:08:12,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:08:12,015 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:08:12,015 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 01:08:12,015 INFO L794 eck$LassoCheckResult]: Stem: 508#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 496#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 497#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 505#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 506#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 509#L546 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 522#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 515#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 513#L551 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 514#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 519#L551 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 518#L551-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 517#L544-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 516#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 510#L546 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 498#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 499#L551-2 [2018-12-02 01:08:12,015 INFO L796 eck$LassoCheckResult]: Loop: 499#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 512#L551 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 499#L551-2 [2018-12-02 01:08:12,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:12,016 INFO L82 PathProgramCache]: Analyzing trace with hash 221162235, now seen corresponding path program 1 times [2018-12-02 01:08:12,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:12,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:12,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:12,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:08:12,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:12,018 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 01:08:12,018 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 01:08:12,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-02 01:08:12,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:12,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:12,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 5 times [2018-12-02 01:08:12,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:12,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:12,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:08:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:12,060 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 01:08:12,060 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 01:08:12,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-02 01:08:12,069 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 01:08:12,072 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-02 01:08:12,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 01:08:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:12,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:12,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2083511360, now seen corresponding path program 2 times [2018-12-02 01:08:12,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:08:12,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:08:12,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:12,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:08:12,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:08:12,096 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 01:08:12,096 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 01:08:12,096 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f56903f1-4476-4639-a8bc-33bcce4e7960/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-02 01:08:12,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 01:08:12,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 01:08:12,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 01:08:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:08:12,340 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 105 [2018-12-02 01:08:12,377 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 01:08:12,377 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 01:08:12,377 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 01:08:12,377 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 01:08:12,377 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 01:08:12,377 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:08:12,377 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 01:08:12,377 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 01:08:12,377 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-12-02 01:08:12,377 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 01:08:12,377 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 01:08:12,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:12,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:12,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:12,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:12,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:12,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:12,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:12,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:12,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:12,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:12,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:12,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:08:12,620 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 01:08:12,620 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 01:08:12,620 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-12-02 01:08:12,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:12,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:08:12,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:12,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:12,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:12,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:08:12,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:08:12,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:12,622 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-12-02 01:08:12,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:12,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:08:12,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:12,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:12,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:12,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:08:12,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:08:12,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:12,623 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-12-02 01:08:12,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:12,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:08:12,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:12,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:12,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:12,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:08:12,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:08:12,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:12,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:08:12,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:12,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:12,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:12,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:12,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:08:12,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:08:12,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:12,625 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-12-02 01:08:12,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:12,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:08:12,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:12,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:12,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:12,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:08:12,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:08:12,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:12,627 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-12-02 01:08:12,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:12,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:08:12,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:12,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:12,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:12,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:08:12,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:08:12,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:08:12,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:08:12,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:08:12,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:08:12,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:08:12,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:08:12,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:08:12,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 01:08:12,632 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 01:08:12,633 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 01:08:12,633 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 01:08:12,634 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 01:08:12,634 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 01:08:12,634 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 01:08:12,634 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-12-02 01:08:12,640 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-02 01:08:12,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 01:08:12,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:08:12,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:08:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:08:12,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:08:12,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:08:12,694 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-12-02 01:08:12,694 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-02 01:08:12,706 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 7 states. [2018-12-02 01:08:12,706 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-12-02 01:08:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 01:08:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-02 01:08:12,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-02 01:08:12,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:08:12,707 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 01:08:12,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:08:12,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:08:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:08:12,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:08:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:08:12,740 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 01:08:12,740 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-02 01:08:12,749 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 7 states. [2018-12-02 01:08:12,750 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-12-02 01:08:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 01:08:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-02 01:08:12,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-02 01:08:12,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:08:12,751 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 01:08:12,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:08:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:08:12,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:08:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:08:12,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:08:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:08:12,778 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 01:08:12,779 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-02 01:08:12,789 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 6 states. [2018-12-02 01:08:12,790 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-12-02 01:08:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 01:08:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-12-02 01:08:12,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-02 01:08:12,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:08:12,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 2 letters. [2018-12-02 01:08:12,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:08:12,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2018-12-02 01:08:12,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 01:08:12,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-12-02 01:08:12,792 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 01:08:12,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2018-12-02 01:08:12,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 01:08:12,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 01:08:12,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 01:08:12,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 01:08:12,793 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 01:08:12,793 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 01:08:12,793 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 01:08:12,793 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 01:08:12,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 01:08:12,793 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 01:08:12,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 01:08:12,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 01:08:12 BoogieIcfgContainer [2018-12-02 01:08:12,797 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 01:08:12,797 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:08:12,797 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:08:12,797 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:08:12,798 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:08:09" (3/4) ... [2018-12-02 01:08:12,800 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 01:08:12,800 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:08:12,801 INFO L168 Benchmark]: Toolchain (without parser) took 3273.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.6 MB). Free memory was 950.6 MB in the beginning and 841.0 MB in the end (delta: 109.6 MB). Peak memory consumption was 338.2 MB. Max. memory is 11.5 GB. [2018-12-02 01:08:12,801 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:08:12,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:08:12,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:08:12,802 INFO L168 Benchmark]: Boogie Preprocessor took 14.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:08:12,802 INFO L168 Benchmark]: RCFGBuilder took 147.82 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-02 01:08:12,802 INFO L168 Benchmark]: BuchiAutomizer took 2833.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 841.0 MB in the end (delta: 260.3 MB). Peak memory consumption was 349.4 MB. Max. memory is 11.5 GB. [2018-12-02 01:08:12,803 INFO L168 Benchmark]: Witness Printer took 2.87 ms. Allocated memory is still 1.3 GB. Free memory is still 841.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:08:12,804 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 247.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 147.82 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2833.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 841.0 MB in the end (delta: 260.3 MB). Peak memory consumption was 349.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.87 ms. Allocated memory is still 1.3 GB. Free memory is still 841.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 119 SDtfs, 72 SDslu, 68 SDs, 0 SdLazy, 149 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital173 mio100 ax100 hnf99 lsp96 ukn69 mio100 lsp53 div100 bol100 ite100 ukn100 eq174 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...