./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/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_afd5e398-736d-4216-9513-58f2294f1cda/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/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-0cd3be1 [2018-11-28 10:36:48,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:36:48,013 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:36:48,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:36:48,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:36:48,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:36:48,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:36:48,022 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:36:48,023 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:36:48,024 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:36:48,025 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:36:48,025 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:36:48,025 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:36:48,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:36:48,027 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:36:48,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:36:48,028 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:36:48,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:36:48,030 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:36:48,031 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:36:48,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:36:48,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:36:48,034 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:36:48,034 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:36:48,035 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:36:48,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:36:48,037 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:36:48,037 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:36:48,038 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:36:48,039 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:36:48,039 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:36:48,039 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:36:48,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:36:48,040 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:36:48,040 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:36:48,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:36:48,041 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 10:36:48,048 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:36:48,048 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:36:48,049 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:36:48,049 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:36:48,049 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:36:48,049 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 10:36:48,049 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 10:36:48,049 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 10:36:48,049 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 10:36:48,049 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 10:36:48,050 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 10:36:48,050 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:36:48,050 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 10:36:48,050 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 10:36:48,050 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:36:48,050 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 10:36:48,050 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:36:48,050 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 10:36:48,051 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 10:36:48,051 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 10:36:48,051 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 10:36:48,051 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 10:36:48,051 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 10:36:48,051 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:36:48,051 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 10:36:48,051 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:36:48,052 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:36:48,052 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 10:36:48,052 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:36:48,052 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:36:48,052 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 10:36:48,053 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 10:36:48,053 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_afd5e398-736d-4216-9513-58f2294f1cda/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-28 10:36:48,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:36:48,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:36:48,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:36:48,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:36:48,087 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:36:48,087 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-11-28 10:36:48,124 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/bin-2019/uautomizer/data/0da9cb7b4/529ae199a77942a4a993f40702b4dcbb/FLAG8d0ccca22 [2018-11-28 10:36:48,459 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:36:48,460 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-11-28 10:36:48,466 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/bin-2019/uautomizer/data/0da9cb7b4/529ae199a77942a4a993f40702b4dcbb/FLAG8d0ccca22 [2018-11-28 10:36:48,475 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/bin-2019/uautomizer/data/0da9cb7b4/529ae199a77942a4a993f40702b4dcbb [2018-11-28 10:36:48,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:36:48,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 10:36:48,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:36:48,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:36:48,481 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:36:48,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:36:48" (1/1) ... [2018-11-28 10:36:48,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed069a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:36:48, skipping insertion in model container [2018-11-28 10:36:48,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:36:48" (1/1) ... [2018-11-28 10:36:48,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:36:48,517 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:36:48,705 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:36:48,756 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:36:48,779 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:36:48,810 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:36:48,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:36:48 WrapperNode [2018-11-28 10:36:48,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:36:48,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 10:36:48,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 10:36:48,811 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 10:36:48,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:36:48" (1/1) ... [2018-11-28 10:36:48,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:36:48" (1/1) ... [2018-11-28 10:36:48,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 10:36:48,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:36:48,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:36:48,838 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:36:48,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:36:48" (1/1) ... [2018-11-28 10:36:48,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:36:48" (1/1) ... [2018-11-28 10:36:48,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:36:48" (1/1) ... [2018-11-28 10:36:48,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:36:48" (1/1) ... [2018-11-28 10:36:48,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:36:48" (1/1) ... [2018-11-28 10:36:48,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:36:48" (1/1) ... [2018-11-28 10:36:48,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:36:48" (1/1) ... [2018-11-28 10:36:48,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:36:48,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:36:48,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:36:48,853 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:36:48,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:36:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/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-28 10:36:48,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 10:36:48,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 10:36:48,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 10:36:48,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 10:36:48,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:36:48,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:36:49,063 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:36:49,063 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 10:36:49,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:36:49 BoogieIcfgContainer [2018-11-28 10:36:49,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:36:49,064 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 10:36:49,064 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 10:36:49,067 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 10:36:49,068 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:36:49,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 10:36:48" (1/3) ... [2018-11-28 10:36:49,069 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20afc1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:36:49, skipping insertion in model container [2018-11-28 10:36:49,069 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:36:49,069 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:36:48" (2/3) ... [2018-11-28 10:36:49,069 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20afc1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:36:49, skipping insertion in model container [2018-11-28 10:36:49,070 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:36:49,070 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:36:49" (3/3) ... [2018-11-28 10:36:49,072 INFO L375 chiAutomizerObserver]: Analyzing ICFG array03-alloca_true-valid-memsafety_true-termination.i [2018-11-28 10:36:49,120 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:36:49,121 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 10:36:49,121 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 10:36:49,121 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 10:36:49,121 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:36:49,121 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:36:49,121 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 10:36:49,121 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:36:49,122 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 10:36:49,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 10:36:49,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 10:36:49,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:36:49,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:36:49,157 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 10:36:49,157 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 10:36:49,158 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 10:36:49,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 10:36:49,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 10:36:49,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:36:49,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:36:49,159 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 10:36:49,159 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 10:36:49,166 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 15#L560true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 5#L560-2true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 11#L544-3true [2018-11-28 10:36:49,166 INFO L796 eck$LassoCheckResult]: Loop: 11#L544-3true assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 7#L546true assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 17#L551-2true assume !true; 4#L551-3true call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 9#L544-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 11#L544-3true [2018-11-28 10:36:49,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:49,172 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-28 10:36:49,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:49,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:49,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:49,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:49,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:49,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:49,266 INFO L82 PathProgramCache]: Analyzing trace with hash 44963621, now seen corresponding path program 1 times [2018-11-28 10:36:49,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:49,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:49,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:49,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:49,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:49,288 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-28 10:36:49,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:49,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:36:49,291 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:36:49,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 10:36:49,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 10:36:49,301 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-28 10:36:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:49,305 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-11-28 10:36:49,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 10:36:49,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-28 10:36:49,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 10:36:49,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2018-11-28 10:36:49,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 10:36:49,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 10:36:49,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2018-11-28 10:36:49,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:36:49,311 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 10:36:49,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2018-11-28 10:36:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-28 10:36:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 10:36:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-11-28 10:36:49,329 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 10:36:49,329 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 10:36:49,329 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 10:36:49,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-11-28 10:36:49,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 10:36:49,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:36:49,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:36:49,330 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 10:36:49,330 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 10:36:49,331 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 40#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 41#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 45#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 44#L544-3 [2018-11-28 10:36:49,331 INFO L796 eck$LassoCheckResult]: Loop: 44#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 47#L546 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 43#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 48#L551 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 38#L551-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 39#L544-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 44#L544-3 [2018-11-28 10:36:49,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:49,331 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-28 10:36:49,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:49,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:49,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:49,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:49,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:49,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:49,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1393657929, now seen corresponding path program 1 times [2018-11-28 10:36:49,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:49,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:49,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:49,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:36:49,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:49,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:49,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1898369747, now seen corresponding path program 1 times [2018-11-28 10:36:49,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:49,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:49,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:49,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:49,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:49,609 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:36:49,610 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:36:49,610 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:36:49,611 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:36:49,611 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:36:49,611 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:36:49,611 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:36:49,611 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:36:49,611 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-28 10:36:49,612 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:36:49,612 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:36:49,632 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-28 10:36:49,637 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-28 10:36:49,639 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-28 10:36:49,642 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-28 10:36:49,730 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-28 10:36:49,732 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-28 10:36:49,735 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-28 10:36:49,738 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-28 10:36:49,739 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-28 10:36:49,742 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-28 10:36:49,743 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-28 10:36:49,744 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-28 10:36:49,963 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:36:49,966 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:36:49,968 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-28 10:36:49,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:49,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:36:49,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:49,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:49,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:49,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:36:49,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:36:49,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:49,974 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-28 10:36:49,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:49,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:36:49,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:49,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:49,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:49,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:36:49,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:36:49,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:49,978 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-28 10:36:49,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:49,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:36:49,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:49,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:49,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:49,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:36:49,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:36:49,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:49,980 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-28 10:36:49,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:49,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:36:49,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:49,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:49,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:49,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:36:49,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:36:49,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:49,984 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-28 10:36:49,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:49,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:36:49,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:49,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:49,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:49,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:36:49,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:36:49,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:49,987 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-28 10:36:49,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:49,988 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:36:49,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:49,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:49,991 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:36:49,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:36:50,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:50,008 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-28 10:36:50,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:50,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:50,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:50,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:50,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:36:50,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:36:50,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:50,014 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-28 10:36:50,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:50,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:50,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:50,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:50,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:36:50,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:36:50,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:50,026 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-28 10:36:50,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:50,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:50,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:50,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:50,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:36:50,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:36:50,073 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:36:50,095 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 10:36:50,096 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 10:36:50,098 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:36:50,099 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:36:50,099 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:36:50,099 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-28 10:36:50,137 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 10:36:50,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:50,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:36:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:50,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:36:50,188 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-28 10:36:50,190 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-28 10:36:50,191 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 10:36:50,225 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 18 states and 26 transitions. Complement of second has 4 states. [2018-11-28 10:36:50,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 10:36:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:36:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-11-28 10:36:50,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 10:36:50,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:36:50,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 10:36:50,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:36:50,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-28 10:36:50,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:36:50,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 26 transitions. [2018-11-28 10:36:50,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:36:50,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 24 transitions. [2018-11-28 10:36:50,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 10:36:50,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 10:36:50,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2018-11-28 10:36:50,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:36:50,231 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-28 10:36:50,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2018-11-28 10:36:50,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 10:36:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 10:36:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-11-28 10:36:50,235 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-28 10:36:50,235 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-28 10:36:50,235 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 10:36:50,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2018-11-28 10:36:50,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:36:50,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:36:50,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:36:50,236 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 10:36:50,236 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 10:36:50,237 INFO L794 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 129#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 130#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 137#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 138#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 142#L546 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 132#L551-2 [2018-11-28 10:36:50,237 INFO L796 eck$LassoCheckResult]: Loop: 132#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 143#L551 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 132#L551-2 [2018-11-28 10:36:50,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:50,237 INFO L82 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2018-11-28 10:36:50,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:50,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:50,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:50,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:50,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:50,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:50,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2018-11-28 10:36:50,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:50,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:50,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:50,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:50,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:50,259 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 10:36:50,259 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 10:36:50,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/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-28 10:36:50,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:50,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:50,308 INFO L82 PathProgramCache]: Analyzing trace with hash 176795341, now seen corresponding path program 1 times [2018-11-28 10:36:50,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:50,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:50,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:50,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:50,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:50,313 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 10:36:50,313 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 10:36:50,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-11-28 10:36:50,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 10:36:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:50,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:36:50,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-28 10:36:50,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-11-28 10:36:50,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:36:50,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:36:50,442 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-28 10:36:50,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-11-28 10:36:50,445 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-28 10:36:50,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:50,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:36:50,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:36:50,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:36:50,480 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 10:36:50,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:50,514 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-11-28 10:36:50,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:36:50,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-28 10:36:50,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:36:50,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2018-11-28 10:36:50,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 10:36:50,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 10:36:50,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2018-11-28 10:36:50,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:36:50,516 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-28 10:36:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2018-11-28 10:36:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-28 10:36:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 10:36:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-28 10:36:50,517 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 10:36:50,517 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 10:36:50,517 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 10:36:50,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-28 10:36:50,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:36:50,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:36:50,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:36:50,518 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:50,518 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 10:36:50,519 INFO L794 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 201#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 202#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 208#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 209#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 212#L546 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 203#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 204#L551-2 [2018-11-28 10:36:50,519 INFO L796 eck$LassoCheckResult]: Loop: 204#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 214#L551 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 204#L551-2 [2018-11-28 10:36:50,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:50,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-11-28 10:36:50,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:50,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:50,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:50,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:50,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:50,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:50,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 2 times [2018-11-28 10:36:50,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:50,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:50,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:50,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:50,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:50,531 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 10:36:50,531 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 10:36:50,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/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-28 10:36:50,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 10:36:50,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 10:36:50,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 10:36:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:50,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:50,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1185742934, now seen corresponding path program 1 times [2018-11-28 10:36:50,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:50,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:50,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:50,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:36:50,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:50,569 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 10:36:50,569 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 10:36:50,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/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-28 10:36:50,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:50,784 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-11-28 10:36:50,822 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:36:50,822 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:36:50,823 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:36:50,823 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:36:50,823 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:36:50,823 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:36:50,823 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:36:50,823 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:36:50,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-28 10:36:50,823 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:36:50,824 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:36:50,826 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-28 10:36:50,835 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-28 10:36:50,836 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-28 10:36:50,838 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-28 10:36:50,840 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-28 10:36:50,841 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-28 10:36:50,954 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-28 10:36:50,955 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-28 10:36:50,956 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-28 10:36:50,958 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-28 10:36:50,959 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-28 10:36:50,960 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-28 10:36:51,123 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:36:51,124 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:36:51,124 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-28 10:36:51,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:51,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:36:51,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:51,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:51,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:51,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:36:51,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:36:51,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:51,126 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-28 10:36:51,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:51,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:36:51,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:51,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:51,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:51,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:36:51,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:36:51,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:51,128 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-28 10:36:51,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:51,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:36:51,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:51,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:51,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:51,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:36:51,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:36:51,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:51,130 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-28 10:36:51,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:51,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:51,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:51,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:51,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:36:51,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:36:51,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:51,133 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-28 10:36:51,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:51,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:36:51,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:51,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:51,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:51,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:36:51,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:36:51,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:51,135 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-28 10:36:51,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:51,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:51,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:51,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:51,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:36:51,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:36:51,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:51,151 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-28 10:36:51,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:51,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:51,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:51,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:51,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:36:51,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:36:51,161 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:36:51,163 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 10:36:51,164 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 10:36:51,164 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:36:51,165 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:36:51,166 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:36:51,166 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-28 10:36:51,172 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 10:36:51,174 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 10:36:51,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:51,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:36:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:51,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:36:51,207 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-28 10:36:51,207 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-28 10:36:51,207 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 10:36:51,218 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 54 transitions. Complement of second has 7 states. [2018-11-28 10:36:51,218 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-28 10:36:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:36:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 10:36:51,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 10:36:51,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:36:51,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 10:36:51,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:36:51,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-28 10:36:51,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:36:51,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2018-11-28 10:36:51,220 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 10:36:51,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 47 transitions. [2018-11-28 10:36:51,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 10:36:51,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 10:36:51,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2018-11-28 10:36:51,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:36:51,221 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-11-28 10:36:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2018-11-28 10:36:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-28 10:36:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 10:36:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-11-28 10:36:51,224 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-11-28 10:36:51,224 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-11-28 10:36:51,224 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 10:36:51,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2018-11-28 10:36:51,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:36:51,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:36:51,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:36:51,224 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:51,224 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 10:36:51,225 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 320#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 321#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 328#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 329#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 333#L546 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 322#L548 assume test_fun_#t~mem4 < 0;havoc test_fun_#t~mem4;test_fun_~res~0 := 0; 323#L551-2 [2018-11-28 10:36:51,225 INFO L796 eck$LassoCheckResult]: Loop: 323#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 337#L551 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 323#L551-2 [2018-11-28 10:36:51,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:51,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2018-11-28 10:36:51,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:51,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:51,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:51,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:51,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:51,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 3 times [2018-11-28 10:36:51,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:51,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,238 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 10:36:51,238 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 10:36:51,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/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-28 10:36:51,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 10:36:51,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-28 10:36:51,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 10:36:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:51,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:51,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741012, now seen corresponding path program 1 times [2018-11-28 10:36:51,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:51,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:51,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:36:51,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,282 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 10:36:51,282 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 10:36:51,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/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-28 10:36:51,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:51,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:36:51,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-28 10:36:51,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-11-28 10:36:51,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:36:51,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:36:51,346 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-28 10:36:51,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-11-28 10:36:51,351 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-28 10:36:51,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:51,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:36:51,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:36:51,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:36:51,403 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-28 10:36:51,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:51,431 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-28 10:36:51,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:36:51,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2018-11-28 10:36:51,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:36:51,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 41 transitions. [2018-11-28 10:36:51,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 10:36:51,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 10:36:51,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-11-28 10:36:51,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:36:51,433 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-28 10:36:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-11-28 10:36:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-11-28 10:36:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 10:36:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-28 10:36:51,435 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-28 10:36:51,435 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-28 10:36:51,435 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 10:36:51,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2018-11-28 10:36:51,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:36:51,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:36:51,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:36:51,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:51,436 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 10:36:51,436 INFO L794 eck$LassoCheckResult]: Stem: 436#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 424#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 425#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 433#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 434#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 437#L546 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 440#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 443#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 444#L551 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 448#L551-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 447#L544-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 445#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 438#L546 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 426#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 427#L551-2 [2018-11-28 10:36:51,437 INFO L796 eck$LassoCheckResult]: Loop: 427#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 441#L551 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 427#L551-2 [2018-11-28 10:36:51,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:51,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1864345184, now seen corresponding path program 1 times [2018-11-28 10:36:51,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:51,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:51,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:51,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:36:51,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:36:51,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:36:51,477 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:36:51,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:51,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 4 times [2018-11-28 10:36:51,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:51,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:51,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:51,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,479 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 10:36:51,479 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 10:36:51,479 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/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-28 10:36:51,494 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 10:36:51,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 10:36:51,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 10:36:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:51,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:36:51,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:36:51,563 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-28 10:36:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:36:51,591 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2018-11-28 10:36:51,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 10:36:51,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2018-11-28 10:36:51,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:36:51,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2018-11-28 10:36:51,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 10:36:51,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 10:36:51,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-11-28 10:36:51,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:36:51,593 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-28 10:36:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-11-28 10:36:51,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-28 10:36:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 10:36:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-11-28 10:36:51,595 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-28 10:36:51,595 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-28 10:36:51,595 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 10:36:51,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2018-11-28 10:36:51,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:36:51,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:36:51,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:36:51,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:36:51,597 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 10:36:51,597 INFO L794 eck$LassoCheckResult]: Stem: 508#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 496#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 497#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 505#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 506#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 509#L546 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 522#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 515#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 513#L551 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 514#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 519#L551 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 518#L551-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 517#L544-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 516#L544-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 510#L546 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 498#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 499#L551-2 [2018-11-28 10:36:51,597 INFO L796 eck$LassoCheckResult]: Loop: 499#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 512#L551 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 499#L551-2 [2018-11-28 10:36:51,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:51,597 INFO L82 PathProgramCache]: Analyzing trace with hash 221162235, now seen corresponding path program 1 times [2018-11-28 10:36:51,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:51,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:51,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:36:51,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,600 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 10:36:51,600 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 10:36:51,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/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-28 10:36:51,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:51,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:51,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 5 times [2018-11-28 10:36:51,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:51,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:51,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:36:51,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,642 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 10:36:51,642 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 10:36:51,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/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-28 10:36:51,652 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 10:36:51,657 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 10:36:51,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 10:36:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:51,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:51,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2083511360, now seen corresponding path program 2 times [2018-11-28 10:36:51,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:36:51,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:36:51,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:36:51,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:36:51,677 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 10:36:51,677 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 10:36:51,677 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afd5e398-736d-4216-9513-58f2294f1cda/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-28 10:36:51,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 10:36:51,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 10:36:51,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 10:36:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:36:51,905 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 105 [2018-11-28 10:36:51,940 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:36:51,940 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:36:51,941 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:36:51,941 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:36:51,941 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:36:51,941 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:36:51,941 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:36:51,941 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:36:51,941 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-11-28 10:36:51,941 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:36:51,941 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:36:51,943 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-28 10:36:51,944 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-28 10:36:51,945 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-28 10:36:51,946 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-28 10:36:51,948 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-28 10:36:51,949 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-28 10:36:51,950 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-28 10:36:52,034 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-28 10:36:52,035 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-28 10:36:52,036 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-28 10:36:52,037 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-28 10:36:52,038 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-28 10:36:52,184 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:36:52,184 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:36:52,185 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-28 10:36:52,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:52,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:36:52,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:52,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:52,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:52,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:36:52,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:36:52,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:52,187 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-28 10:36:52,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:52,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:36:52,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:52,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:52,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:52,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:36:52,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:36:52,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:52,188 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-28 10:36:52,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:52,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:36:52,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:52,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:52,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:52,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:36:52,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:36:52,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:52,190 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-28 10:36:52,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:52,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:52,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:52,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:52,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:36:52,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:36:52,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:52,193 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-28 10:36:52,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:52,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:36:52,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:52,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:52,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:52,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:36:52,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:36:52,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:52,194 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-28 10:36:52,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:52,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:36:52,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:52,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:52,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:52,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:36:52,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:36:52,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:36:52,196 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-28 10:36:52,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:36:52,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:36:52,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:36:52,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:36:52,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:36:52,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:36:52,202 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:36:52,205 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 10:36:52,205 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 10:36:52,205 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:36:52,206 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:36:52,206 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:36:52,206 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-28 10:36:52,228 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 10:36:52,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 10:36:52,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:52,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:36:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:52,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:36:52,267 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-28 10:36:52,267 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-28 10:36:52,267 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 10:36:52,280 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 7 states. [2018-11-28 10:36:52,280 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-28 10:36:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:36:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 10:36:52,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 10:36:52,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:36:52,281 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 10:36:52,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:52,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:36:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:52,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:36:52,317 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-28 10:36:52,317 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-28 10:36:52,317 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 10:36:52,329 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 7 states. [2018-11-28 10:36:52,330 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-28 10:36:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:36:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 10:36:52,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 10:36:52,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:36:52,331 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 10:36:52,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:36:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:52,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:36:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:36:52,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:36:52,366 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-28 10:36:52,366 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-28 10:36:52,366 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 10:36:52,379 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 6 states. [2018-11-28 10:36:52,381 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-28 10:36:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:36:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-28 10:36:52,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 10:36:52,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:36:52,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 2 letters. [2018-11-28 10:36:52,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:36:52,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-28 10:36:52,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:36:52,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-11-28 10:36:52,384 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:36:52,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2018-11-28 10:36:52,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 10:36:52,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 10:36:52,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 10:36:52,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:36:52,384 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:36:52,384 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:36:52,384 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:36:52,384 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 10:36:52,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 10:36:52,384 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:36:52,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 10:36:52,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 10:36:52 BoogieIcfgContainer [2018-11-28 10:36:52,390 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 10:36:52,391 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:36:52,391 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:36:52,391 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:36:52,391 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:36:49" (3/4) ... [2018-11-28 10:36:52,394 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 10:36:52,394 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:36:52,395 INFO L168 Benchmark]: Toolchain (without parser) took 3917.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.7 MB). Free memory was 956.0 MB in the beginning and 824.2 MB in the end (delta: 131.7 MB). Peak memory consumption was 352.5 MB. Max. memory is 11.5 GB. [2018-11-28 10:36:52,395 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:36:52,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:36:52,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:36:52,396 INFO L168 Benchmark]: Boogie Preprocessor took 14.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:36:52,396 INFO L168 Benchmark]: RCFGBuilder took 210.67 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.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-28 10:36:52,397 INFO L168 Benchmark]: BuchiAutomizer took 3326.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 824.2 MB in the end (delta: 278.9 MB). Peak memory consumption was 362.8 MB. Max. memory is 11.5 GB. [2018-11-28 10:36:52,397 INFO L168 Benchmark]: Witness Printer took 3.44 ms. Allocated memory is still 1.2 GB. Free memory is still 824.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:36:52,399 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 210.67 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.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3326.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 824.2 MB in the end (delta: 278.9 MB). Peak memory consumption was 362.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.44 ms. Allocated memory is still 1.2 GB. Free memory is still 824.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 119 SDtfs, 72 SDslu, 68 SDs, 0 SdLazy, 149 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital173 mio100 ax100 hnf99 lsp96 ukn69 mio100 lsp53 div100 bol100 ite100 ukn100 eq174 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms 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...