./Ultimate.py --spec ../../sv-benchmarks/c/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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/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_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/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-5842f4b [2018-11-18 12:06:40,043 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:06:40,045 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:06:40,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:06:40,054 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:06:40,055 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:06:40,056 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:06:40,057 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:06:40,058 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:06:40,059 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:06:40,059 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:06:40,060 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:06:40,060 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:06:40,061 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:06:40,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:06:40,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:06:40,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:06:40,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:06:40,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:06:40,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:06:40,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:06:40,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:06:40,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:06:40,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:06:40,072 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:06:40,073 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:06:40,073 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:06:40,074 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:06:40,075 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:06:40,076 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:06:40,076 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:06:40,077 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:06:40,077 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:06:40,077 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:06:40,078 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:06:40,078 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:06:40,079 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 12:06:40,091 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:06:40,091 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:06:40,092 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:06:40,092 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:06:40,093 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:06:40,093 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:06:40,093 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:06:40,093 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:06:40,093 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:06:40,093 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:06:40,094 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:06:40,094 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:06:40,094 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:06:40,094 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:06:40,094 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:06:40,096 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:06:40,096 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:06:40,096 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:06:40,096 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:06:40,096 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:06:40,096 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:06:40,097 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:06:40,097 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:06:40,097 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:06:40,097 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:06:40,097 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:06:40,097 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:06:40,098 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:06:40,098 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:06:40,098 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:06:40,098 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:06:40,099 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:06:40,099 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_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/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-11-18 12:06:40,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:06:40,135 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:06:40,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:06:40,139 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:06:40,139 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:06:40,140 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-11-18 12:06:40,186 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/data/aa0edf7b8/47e965073db44aa2ac8fb02f3beb9c4b/FLAG481f53355 [2018-11-18 12:06:40,573 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:06:40,573 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-11-18 12:06:40,581 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/data/aa0edf7b8/47e965073db44aa2ac8fb02f3beb9c4b/FLAG481f53355 [2018-11-18 12:06:40,591 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/data/aa0edf7b8/47e965073db44aa2ac8fb02f3beb9c4b [2018-11-18 12:06:40,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:06:40,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:06:40,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:06:40,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:06:40,599 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:06:40,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:06:40" (1/1) ... [2018-11-18 12:06:40,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3579c64c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:40, skipping insertion in model container [2018-11-18 12:06:40,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:06:40" (1/1) ... [2018-11-18 12:06:40,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:06:40,647 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:06:40,880 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:06:40,888 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:06:40,924 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:06:41,015 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:06:41,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:41 WrapperNode [2018-11-18 12:06:41,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:06:41,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:06:41,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:06:41,016 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:06:41,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:41" (1/1) ... [2018-11-18 12:06:41,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:41" (1/1) ... [2018-11-18 12:06:41,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:06:41,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:06:41,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:06:41,048 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:06:41,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:41" (1/1) ... [2018-11-18 12:06:41,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:41" (1/1) ... [2018-11-18 12:06:41,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:41" (1/1) ... [2018-11-18 12:06:41,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:41" (1/1) ... [2018-11-18 12:06:41,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:41" (1/1) ... [2018-11-18 12:06:41,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:41" (1/1) ... [2018-11-18 12:06:41,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:41" (1/1) ... [2018-11-18 12:06:41,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:06:41,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:06:41,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:06:41,070 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:06:41,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:06:41,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:06:41,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:06:41,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:06:41,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:06:41,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:06:41,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:06:41,297 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:06:41,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:06:41 BoogieIcfgContainer [2018-11-18 12:06:41,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:06:41,299 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:06:41,299 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:06:41,301 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:06:41,302 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:06:41,302 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:06:40" (1/3) ... [2018-11-18 12:06:41,302 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d3eace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:06:41, skipping insertion in model container [2018-11-18 12:06:41,303 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:06:41,303 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:06:41" (2/3) ... [2018-11-18 12:06:41,303 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d3eace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:06:41, skipping insertion in model container [2018-11-18 12:06:41,303 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:06:41,303 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:06:41" (3/3) ... [2018-11-18 12:06:41,304 INFO L375 chiAutomizerObserver]: Analyzing ICFG array03-alloca_true-valid-memsafety_true-termination.i [2018-11-18 12:06:41,354 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:06:41,354 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:06:41,354 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:06:41,354 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:06:41,355 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:06:41,355 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:06:41,355 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:06:41,355 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:06:41,355 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:06:41,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-18 12:06:41,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 12:06:41,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:41,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:41,388 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:06:41,388 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:06:41,389 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:06:41,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-18 12:06:41,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 12:06:41,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:41,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:41,390 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:06:41,390 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:06:41,398 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 18#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;assume { :begin_inline_test_fun } true;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; 14#L544-4true [2018-11-18 12:06:41,398 INFO L796 eck$LassoCheckResult]: Loop: 14#L544-4true assume true; 9#L544-1true 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); 8#L546true assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 3#L551-3true assume !true; 7#L551-4true call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 12#L544-3true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 14#L544-4true [2018-11-18 12:06:41,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:41,403 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-18 12:06:41,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:41,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:41,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:41,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:41,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:41,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1276972412, now seen corresponding path program 1 times [2018-11-18 12:06:41,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:41,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:41,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:41,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:41,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:41,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:06:41,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:06:41,531 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:06:41,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 12:06:41,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:06:41,543 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-11-18 12:06:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:06:41,548 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-18 12:06:41,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 12:06:41,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-18 12:06:41,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 12:06:41,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 17 transitions. [2018-11-18 12:06:41,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 12:06:41,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 12:06:41,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-18 12:06:41,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:06:41,555 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-18 12:06:41,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-18 12:06:41,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 12:06:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 12:06:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-18 12:06:41,578 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-18 12:06:41,578 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-18 12:06:41,578 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:06:41,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-18 12:06:41,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 12:06:41,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:41,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:41,579 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:06:41,579 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:41,579 INFO L794 eck$LassoCheckResult]: Stem: 53#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 51#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 52#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;assume { :begin_inline_test_fun } true;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; 46#L544-4 [2018-11-18 12:06:41,580 INFO L796 eck$LassoCheckResult]: Loop: 46#L544-4 assume true; 50#L544-1 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); 49#L546 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 42#L551-3 assume true; 43#L551 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 54#L551-1 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 47#L551-4 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 48#L544-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 46#L544-4 [2018-11-18 12:06:41,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:41,580 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-18 12:06:41,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:41,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:41,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:41,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:41,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1198744842, now seen corresponding path program 1 times [2018-11-18 12:06:41,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:41,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:41,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:41,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:06:41,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:41,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:41,612 INFO L82 PathProgramCache]: Analyzing trace with hash 553555674, now seen corresponding path program 1 times [2018-11-18 12:06:41,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:41,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:41,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:41,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:41,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:41,810 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-18 12:06:41,979 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:06:41,980 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:06:41,980 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:06:41,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:06:41,981 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:06:41,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:06:41,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:06:41,981 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:06:41,981 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-18 12:06:41,981 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:06:41,981 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:06:42,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:42,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:42,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:42,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:42,194 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-11-18 12:06:42,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:42,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:42,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:42,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:42,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:42,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:42,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:42,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:42,644 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:06:42,648 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:06:42,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-11-18 12:06:42,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:42,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:06:42,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:42,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:42,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:42,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:06:42,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:06:42,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:42,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-11-18 12:06:42,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:42,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:06:42,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:42,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:42,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:42,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:06:42,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:06:42,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:42,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:42,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:42,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:06:42,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:42,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:42,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:42,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:06:42,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:06:42,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:42,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:42,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:42,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:06:42,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:42,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:42,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:42,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:06:42,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:06:42,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:42,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:42,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:42,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:06:42,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:42,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:42,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:42,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:06:42,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:06:42,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:42,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:42,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:42,672 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:06:42,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:42,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:42,677 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:06:42,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:06:42,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:42,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:42,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:42,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:42,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:42,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:42,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:06:42,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:06:42,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:42,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:42,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:42,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:42,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:42,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:42,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:06:42,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:06:42,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:42,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:42,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:42,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:42,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:42,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:42,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:06:42,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:06:42,775 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:06:42,801 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:06:42,802 INFO L444 ModelExtractionUtils]: 26 out of 34 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 12:06:42,804 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:06:42,807 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:06:42,808 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:06:42,808 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-11-18 12:06:42,874 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 12:06:43,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:43,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:06:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:43,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:06:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:43,046 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:06:43,047 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-18 12:06:43,085 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 22 states and 30 transitions. Complement of second has 6 states. [2018-11-18 12:06:43,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:06:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:06:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-18 12:06:43,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-18 12:06:43,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:06:43,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 8 letters. [2018-11-18 12:06:43,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:06:43,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 16 letters. [2018-11-18 12:06:43,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:06:43,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2018-11-18 12:06:43,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:06:43,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 28 transitions. [2018-11-18 12:06:43,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 12:06:43,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 12:06:43,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2018-11-18 12:06:43,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:06:43,093 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-18 12:06:43,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2018-11-18 12:06:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 12:06:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 12:06:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-11-18 12:06:43,095 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-18 12:06:43,095 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-18 12:06:43,095 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:06:43,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2018-11-18 12:06:43,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:06:43,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:43,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:43,096 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:43,096 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:06:43,096 INFO L794 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 162#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 163#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 154#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;assume { :begin_inline_test_fun } true;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; 155#L544-4 assume true; 160#L544-1 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); 158#L546 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 148#L551-3 [2018-11-18 12:06:43,097 INFO L796 eck$LassoCheckResult]: Loop: 148#L551-3 assume true; 149#L551 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 166#L551-1 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; 148#L551-3 [2018-11-18 12:06:43,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:43,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1806814475, now seen corresponding path program 1 times [2018-11-18 12:06:43,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:43,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:43,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:43,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:43,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:43,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:43,113 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 1 times [2018-11-18 12:06:43,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:43,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:43,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:43,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:43,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:43,118 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 12:06:43,118 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 12:06:43,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 12:06:43,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:43,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:43,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2015064198, now seen corresponding path program 1 times [2018-11-18 12:06:43,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:43,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:43,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:43,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:43,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:43,253 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 12:06:43,254 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 12:06:43,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 12:06:43,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:43,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:06:43,339 INFO L477 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-11-18 12:06:43,341 INFO L477 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-11-18 12:06:43,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:06:43,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:06:43,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:06:43,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-11-18 12:06:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:43,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:06:43,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:06:43,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:06:43,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:06:43,428 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-18 12:06:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:06:43,506 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-11-18 12:06:43,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:06:43,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-11-18 12:06:43,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:06:43,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 31 transitions. [2018-11-18 12:06:43,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 12:06:43,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 12:06:43,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2018-11-18 12:06:43,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:06:43,509 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-11-18 12:06:43,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2018-11-18 12:06:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-18 12:06:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 12:06:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-18 12:06:43,513 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-18 12:06:43,513 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-18 12:06:43,513 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:06:43,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-18 12:06:43,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:06:43,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:43,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:43,514 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:43,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:06:43,515 INFO L794 eck$LassoCheckResult]: Stem: 251#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 249#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 250#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 240#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;assume { :begin_inline_test_fun } true;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; 241#L544-4 assume true; 247#L544-1 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); 244#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); 234#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 235#L551-3 [2018-11-18 12:06:43,515 INFO L796 eck$LassoCheckResult]: Loop: 235#L551-3 assume true; 238#L551 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 253#L551-1 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; 235#L551-3 [2018-11-18 12:06:43,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:43,515 INFO L82 PathProgramCache]: Analyzing trace with hash 176673967, now seen corresponding path program 1 times [2018-11-18 12:06:43,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:43,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:43,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:43,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:43,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:43,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:43,529 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 2 times [2018-11-18 12:06:43,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:43,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:43,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:43,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:43,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:43,533 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 12:06:43,533 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 12:06:43,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 12:06:43,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 12:06:43,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 12:06:43,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 12:06:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:43,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:43,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1959245142, now seen corresponding path program 1 times [2018-11-18 12:06:43,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:43,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:43,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:43,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:06:43,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:43,610 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 12:06:43,610 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 12:06:43,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 12:06:43,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:43,825 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 12:06:44,120 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2018-11-18 12:06:44,222 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:06:44,223 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:06:44,223 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:06:44,223 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:06:44,223 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:06:44,223 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:06:44,223 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:06:44,223 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:06:44,223 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-18 12:06:44,223 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:06:44,223 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:06:44,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:44,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:44,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:44,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:44,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:44,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:44,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:44,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:44,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:44,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-11-18 12:06:44,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:44,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:44,745 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:06:44,745 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:06:44,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:44,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:44,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:06:44,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:44,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:44,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:44,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:06:44,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:06:44,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:44,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:44,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:44,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:06:44,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:44,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:44,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:44,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:06:44,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:06:44,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:44,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:44,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:44,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:06:44,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:44,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:44,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:44,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:06:44,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:06:44,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:44,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:44,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:44,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:44,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:44,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:44,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:06:44,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:06:44,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:44,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:44,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:44,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:06:44,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:44,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:44,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:44,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:06:44,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:06:44,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:44,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:44,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:44,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:06:44,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:44,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:44,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:44,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:06:44,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:06:44,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:44,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:44,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:44,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:06:44,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:44,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:44,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:44,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:06:44,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:06:44,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:44,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:44,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:44,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:44,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:44,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:44,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:06:44,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:06:44,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:44,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:44,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:44,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:44,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:44,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:44,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:06:44,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:06:44,788 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:06:44,791 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:06:44,791 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:06:44,791 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:06:44,792 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:06:44,792 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:06:44,792 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-11-18 12:06:44,803 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 12:06:44,823 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:06:44,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:44,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:06:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:44,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:06:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:44,893 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:06:44,893 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 30 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-18 12:06:44,908 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 30 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 54 states and 68 transitions. Complement of second has 7 states. [2018-11-18 12:06:44,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:06:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:06:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-18 12:06:44,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 12:06:44,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:06:44,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 12:06:44,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:06:44,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 12:06:44,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:06:44,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 68 transitions. [2018-11-18 12:06:44,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 12:06:44,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 47 states and 59 transitions. [2018-11-18 12:06:44,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 12:06:44,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 12:06:44,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 59 transitions. [2018-11-18 12:06:44,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:06:44,913 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2018-11-18 12:06:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 59 transitions. [2018-11-18 12:06:44,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-11-18 12:06:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 12:06:44,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2018-11-18 12:06:44,917 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-11-18 12:06:44,917 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-11-18 12:06:44,917 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:06:44,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2018-11-18 12:06:44,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:06:44,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:44,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:44,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:44,919 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:06:44,919 INFO L794 eck$LassoCheckResult]: Stem: 400#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 398#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 399#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 387#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;assume { :begin_inline_test_fun } true;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; 388#L544-4 assume true; 404#L544-1 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); 408#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); 380#L548 assume test_fun_#t~mem4 < 0;havoc test_fun_#t~mem4;test_fun_~res~0 := 0; 381#L551-3 [2018-11-18 12:06:44,919 INFO L796 eck$LassoCheckResult]: Loop: 381#L551-3 assume true; 384#L551 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 402#L551-1 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; 381#L551-3 [2018-11-18 12:06:44,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:44,919 INFO L82 PathProgramCache]: Analyzing trace with hash 176673965, now seen corresponding path program 1 times [2018-11-18 12:06:44,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:44,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:44,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:44,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:44,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:44,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:44,930 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 3 times [2018-11-18 12:06:44,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:44,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:44,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:44,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:44,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:44,932 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 12:06:44,932 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 12:06:44,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 12:06:44,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 12:06:44,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-18 12:06:44,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 12:06:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:44,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:44,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1959185560, now seen corresponding path program 1 times [2018-11-18 12:06:44,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:44,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:44,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:44,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:06:44,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:44,969 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 12:06:44,969 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 12:06:44,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 12:06:44,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:44,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:06:45,027 INFO L477 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-11-18 12:06:45,033 INFO L477 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-11-18 12:06:45,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:06:45,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:06:45,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:06:45,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-11-18 12:06:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:45,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:06:45,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:06:45,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:06:45,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:06:45,173 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-18 12:06:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:06:45,219 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-11-18 12:06:45,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:06:45,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2018-11-18 12:06:45,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:06:45,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 43 states and 51 transitions. [2018-11-18 12:06:45,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 12:06:45,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 12:06:45,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 51 transitions. [2018-11-18 12:06:45,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:06:45,224 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-18 12:06:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 51 transitions. [2018-11-18 12:06:45,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-11-18 12:06:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 12:06:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-11-18 12:06:45,226 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-18 12:06:45,226 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-18 12:06:45,226 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:06:45,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2018-11-18 12:06:45,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:06:45,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:45,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:45,230 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:45,230 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:06:45,230 INFO L794 eck$LassoCheckResult]: Stem: 531#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 529#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 530#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 519#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;assume { :begin_inline_test_fun } true;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; 520#L544-4 assume true; 528#L544-1 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); 524#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); 526#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 537#L551-3 assume true; 515#L551 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 542#L551-1 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 541#L551-4 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 540#L544-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 538#L544-4 assume true; 527#L544-1 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); 523#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); 516#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 512#L551-3 [2018-11-18 12:06:45,230 INFO L796 eck$LassoCheckResult]: Loop: 512#L551-3 assume true; 513#L551 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 533#L551-1 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; 512#L551-3 [2018-11-18 12:06:45,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:45,230 INFO L82 PathProgramCache]: Analyzing trace with hash -220718592, now seen corresponding path program 1 times [2018-11-18 12:06:45,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:45,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:45,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:45,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:45,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:45,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:06:45,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:06:45,365 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:06:45,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:45,365 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 4 times [2018-11-18 12:06:45,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:45,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:45,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:45,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:45,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:45,372 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 12:06:45,372 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 12:06:45,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 12:06:45,381 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 12:06:45,386 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 12:06:45,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 12:06:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:45,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:06:45,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:06:45,529 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-18 12:06:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:06:45,582 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-18 12:06:45,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:06:45,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2018-11-18 12:06:45,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:06:45,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 52 transitions. [2018-11-18 12:06:45,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 12:06:45,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 12:06:45,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2018-11-18 12:06:45,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:06:45,586 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-18 12:06:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2018-11-18 12:06:45,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2018-11-18 12:06:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 12:06:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-18 12:06:45,590 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-18 12:06:45,590 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-18 12:06:45,590 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 12:06:45,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 47 transitions. [2018-11-18 12:06:45,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:06:45,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:06:45,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:06:45,591 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:06:45,591 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:06:45,591 INFO L794 eck$LassoCheckResult]: Stem: 623#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 621#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 622#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 612#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;assume { :begin_inline_test_fun } true;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; 613#L544-4 assume true; 619#L544-1 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); 620#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); 637#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 606#L551-3 assume true; 607#L551 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 626#L551-1 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; 640#L551-3 assume true; 641#L551 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 634#L551-1 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 632#L551-4 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 631#L544-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 629#L544-4 assume true; 618#L544-1 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); 616#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); 608#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 604#L551-3 [2018-11-18 12:06:45,591 INFO L796 eck$LassoCheckResult]: Loop: 604#L551-3 assume true; 605#L551 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 625#L551-1 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; 604#L551-3 [2018-11-18 12:06:45,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:45,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1046283577, now seen corresponding path program 1 times [2018-11-18 12:06:45,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:45,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:45,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:45,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:06:45,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:45,599 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 12:06:45,600 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 12:06:45,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/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-11-18 12:06:45,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:45,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 5 times [2018-11-18 12:06:45,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:45,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:45,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:45,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:06:45,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:45,667 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 12:06:45,667 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 12:06:45,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/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-11-18 12:06:45,676 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 12:06:45,680 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 12:06:45,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 12:06:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:45,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:45,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1256407180, now seen corresponding path program 2 times [2018-11-18 12:06:45,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:06:45,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:06:45,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:45,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:06:45,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:06:45,707 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 12:06:45,707 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 12:06:45,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c62faf4-6c00-4b69-b7d1-5cde8fd2fef8/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-11-18 12:06:45,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 12:06:45,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 12:06:45,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 12:06:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:06:46,041 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2018-11-18 12:06:46,107 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:06:46,107 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:06:46,107 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:06:46,107 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:06:46,107 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:06:46,107 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:06:46,107 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:06:46,107 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:06:46,107 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-11-18 12:06:46,107 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:06:46,107 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:06:46,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:46,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:46,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:46,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:46,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:46,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:46,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:46,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:46,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:46,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:46,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:46,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:06:46,529 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:06:46,529 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:06:46,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:46,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:46,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:06:46,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:46,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:46,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:46,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:06:46,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:06:46,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:46,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:46,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:46,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:06:46,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:46,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:46,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:46,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:06:46,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:06:46,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:46,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:46,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:46,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:06:46,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:46,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:46,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:46,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:06:46,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:06:46,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:46,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:46,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:46,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:46,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:46,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:46,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:06:46,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:06:46,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:46,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:46,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:46,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:06:46,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:46,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:46,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:46,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:06:46,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:06:46,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:06:46,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:06:46,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:06:46,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:06:46,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:06:46,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:06:46,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:06:46,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:06:46,546 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:06:46,548 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:06:46,548 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:06:46,549 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:06:46,549 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:06:46,550 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:06:46,550 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-11-18 12:06:46,603 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 12:06:46,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:06:46,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:46,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:06:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:46,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:06:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:46,724 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:06:46,724 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 12:06:46,780 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 47 states and 56 transitions. Complement of second has 7 states. [2018-11-18 12:06:46,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:06:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:06:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-18 12:06:46,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-18 12:06:46,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:06:46,783 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:06:46,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:46,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:06:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:46,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:06:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:46,935 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-11-18 12:06:46,935 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 12:06:46,978 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 47 states and 56 transitions. Complement of second has 7 states. [2018-11-18 12:06:46,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:06:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:06:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-18 12:06:46,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-18 12:06:46,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:06:46,979 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:06:47,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:06:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:47,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:06:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:06:47,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:06:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:06:47,095 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-11-18 12:06:47,095 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 12:06:47,115 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 54 states and 65 transitions. Complement of second has 6 states. [2018-11-18 12:06:47,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:06:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:06:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-18 12:06:47,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-18 12:06:47,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:06:47,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 23 letters. Loop has 3 letters. [2018-11-18 12:06:47,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:06:47,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 20 letters. Loop has 6 letters. [2018-11-18 12:06:47,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:06:47,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2018-11-18 12:06:47,119 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:06:47,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2018-11-18 12:06:47,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:06:47,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:06:47,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:06:47,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:06:47,119 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:06:47,119 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:06:47,119 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:06:47,119 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 12:06:47,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:06:47,120 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:06:47,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:06:47,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:06:47 BoogieIcfgContainer [2018-11-18 12:06:47,124 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:06:47,125 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:06:47,125 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:06:47,125 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:06:47,125 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:06:41" (3/4) ... [2018-11-18 12:06:47,128 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:06:47,128 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:06:47,129 INFO L168 Benchmark]: Toolchain (without parser) took 6534.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 959.1 MB in the beginning and 1.0 GB in the end (delta: -65.8 MB). Peak memory consumption was 126.1 MB. Max. memory is 11.5 GB. [2018-11-18 12:06:47,129 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:06:47,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:06:47,130 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.75 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:06:47,131 INFO L168 Benchmark]: Boogie Preprocessor took 21.12 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:06:47,131 INFO L168 Benchmark]: RCFGBuilder took 228.65 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.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-18 12:06:47,131 INFO L168 Benchmark]: BuchiAutomizer took 5825.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.4 MB). Peak memory consumption was 134.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:06:47,132 INFO L168 Benchmark]: Witness Printer took 3.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:06:47,138 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 419.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.75 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.12 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 228.65 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.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5825.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.4 MB). Peak memory consumption was 134.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. 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 4 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 5.7s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 143 SDtfs, 95 SDslu, 103 SDs, 0 SdLazy, 150 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital173 mio100 ax100 hnf99 lsp96 ukn70 mio100 lsp54 div100 bol100 ite100 ukn100 eq175 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms 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...