./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/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 64bit --witnessprinter.graph.data.programhash ace4aef293e19a259ba259e8c5434d0ef43394b5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:08:09,765 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:08:09,766 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:08:09,778 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:08:09,778 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:08:09,779 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:08:09,782 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:08:09,783 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:08:09,785 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:08:09,788 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:08:09,788 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:08:09,789 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:08:09,789 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:08:09,790 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:08:09,791 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:08:09,791 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:08:09,792 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:08:09,794 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:08:09,795 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:08:09,796 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:08:09,797 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:08:09,798 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:08:09,799 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:08:09,800 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:08:09,800 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:08:09,801 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:08:09,802 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:08:09,802 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:08:09,803 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:08:09,803 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:08:09,803 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:08:09,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:08:09,805 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:08:09,805 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:08:09,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:08:09,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:08:09,806 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:08:09,818 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:08:09,819 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:08:09,820 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:08:09,820 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:08:09,824 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:08:09,824 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:08:09,824 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:08:09,824 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:08:09,824 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:08:09,825 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:08:09,825 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:08:09,825 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:08:09,825 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:08:09,825 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:08:09,825 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:08:09,825 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:08:09,825 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:08:09,826 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:08:09,826 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:08:09,826 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:08:09,826 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:08:09,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:08:09,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:08:09,826 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:08:09,827 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:08:09,827 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:08:09,827 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:08:09,828 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:08:09,832 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_1af28832-bf0c-419e-a816-5f4b97d2580d/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ace4aef293e19a259ba259e8c5434d0ef43394b5 [2018-10-27 06:08:09,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:08:09,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:08:09,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:08:09,891 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:08:09,892 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:08:09,893 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca_true-termination.c.i [2018-10-27 06:08:09,934 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/data/9e256d034/1e829a27818841d5bad6e36b63124829/FLAG2694ba56e [2018-10-27 06:08:10,344 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:08:10,344 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca_true-termination.c.i [2018-10-27 06:08:10,355 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/data/9e256d034/1e829a27818841d5bad6e36b63124829/FLAG2694ba56e [2018-10-27 06:08:10,365 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/data/9e256d034/1e829a27818841d5bad6e36b63124829 [2018-10-27 06:08:10,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:08:10,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:08:10,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:10,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:08:10,372 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:08:10,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:10" (1/1) ... [2018-10-27 06:08:10,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:10, skipping insertion in model container [2018-10-27 06:08:10,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:10" (1/1) ... [2018-10-27 06:08:10,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:08:10,419 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:08:10,638 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:10,647 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:10,703 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:10,733 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:10,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:10 WrapperNode [2018-10-27 06:08:10,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:10,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:10,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:10,735 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:10,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:10" (1/1) ... [2018-10-27 06:08:10,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:10" (1/1) ... [2018-10-27 06:08:10,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:10,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:10,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:10,832 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:10,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:10" (1/1) ... [2018-10-27 06:08:10,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:10" (1/1) ... [2018-10-27 06:08:10,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:10" (1/1) ... [2018-10-27 06:08:10,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:10" (1/1) ... [2018-10-27 06:08:10,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:10" (1/1) ... [2018-10-27 06:08:10,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:10" (1/1) ... [2018-10-27 06:08:10,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:10" (1/1) ... [2018-10-27 06:08:10,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:10,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:10,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:10,856 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:10,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/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-10-27 06:08:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:08:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:08:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:10,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:11,325 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:11,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:11 BoogieIcfgContainer [2018-10-27 06:08:11,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:11,327 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:08:11,327 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:08:11,330 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:08:11,331 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:11,331 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:08:10" (1/3) ... [2018-10-27 06:08:11,332 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@432ca1d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:11, skipping insertion in model container [2018-10-27 06:08:11,332 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:11,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:10" (2/3) ... [2018-10-27 06:08:11,333 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@432ca1d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:11, skipping insertion in model container [2018-10-27 06:08:11,333 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:11,333 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:11" (3/3) ... [2018-10-27 06:08:11,334 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca_true-termination.c.i [2018-10-27 06:08:11,384 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:08:11,385 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:08:11,385 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:08:11,385 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:08:11,385 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:11,385 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:11,385 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:08:11,385 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:11,385 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:08:11,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-10-27 06:08:11,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:11,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:11,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:11,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:08:11,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:11,425 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:08:11,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-10-27 06:08:11,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:11,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:11,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:11,427 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:08:11,427 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:11,435 INFO L793 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 20#L550true SUMMARY for call write~int(0, main_~i~0.base, main_~i~0.offset, 4); srcloc: L550 23#L550-1true SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L550-1 24#L552-3true [2018-10-27 06:08:11,435 INFO L795 eck$LassoCheckResult]: Loop: 24#L552-3true assume true; 14#L554-2true SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 17#L552-1true assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 10#L553true SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 15#L553-1true main_#t~post6 := main_#t~mem5; 18#L553-2true SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 21#L553-3true havoc main_#t~post6;havoc main_#t~mem5; 7#L554true SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 11#L554-1true assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 6#L555true SUMMARY for call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L555 8#L555-1true main_#t~post9 := main_#t~mem8; 12#L555-2true SUMMARY for call write~int(main_#t~post9 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L555-2 16#L555-3true havoc main_#t~post9;havoc main_#t~mem8; 24#L552-3true [2018-10-27 06:08:11,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:11,443 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 1 times [2018-10-27 06:08:11,445 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:11,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:11,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:11,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:11,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:11,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:11,599 INFO L82 PathProgramCache]: Analyzing trace with hash -672637515, now seen corresponding path program 1 times [2018-10-27 06:08:11,599 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:11,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:11,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:11,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:11,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:11,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:11,624 INFO L82 PathProgramCache]: Analyzing trace with hash 315201330, now seen corresponding path program 1 times [2018-10-27 06:08:11,624 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:11,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:11,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:11,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:11,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:12,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:12,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 06:08:12,182 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-27 06:08:12,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:08:12,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:08:12,283 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 10 states. [2018-10-27 06:08:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:12,770 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-10-27 06:08:12,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:08:12,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 42 transitions. [2018-10-27 06:08:12,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:12,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 31 states and 32 transitions. [2018-10-27 06:08:12,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-10-27 06:08:12,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-10-27 06:08:12,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 32 transitions. [2018-10-27 06:08:12,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:12,779 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-10-27 06:08:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 32 transitions. [2018-10-27 06:08:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-10-27 06:08:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 06:08:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-10-27 06:08:12,802 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-10-27 06:08:12,802 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-10-27 06:08:12,802 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:08:12,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2018-10-27 06:08:12,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:12,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:12,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:12,803 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:12,804 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:12,804 INFO L793 eck$LassoCheckResult]: Stem: 104#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 98#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 99#L550 SUMMARY for call write~int(0, main_~i~0.base, main_~i~0.offset, 4); srcloc: L550 110#L550-1 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L550-1 111#L552-3 assume true; 118#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 117#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 116#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 115#L553-1 main_#t~post6 := main_#t~mem5; 108#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 109#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 95#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 96#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 100#L554-2 [2018-10-27 06:08:12,804 INFO L795 eck$LassoCheckResult]: Loop: 100#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 105#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 101#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 102#L553-1 main_#t~post6 := main_#t~mem5; 106#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 114#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 113#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 112#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 100#L554-2 [2018-10-27 06:08:12,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:12,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1741108398, now seen corresponding path program 1 times [2018-10-27 06:08:12,805 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:12,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:12,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:12,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:12,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash -657245557, now seen corresponding path program 1 times [2018-10-27 06:08:12,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:12,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:12,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:12,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:12,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:12,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1570409928, now seen corresponding path program 2 times [2018-10-27 06:08:12,845 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:12,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:12,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:12,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:13,177 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-27 06:08:13,377 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2018-10-27 06:08:13,470 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:13,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:13,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:13,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:13,471 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:13,471 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:13,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:13,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:13,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:08:13,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:13,472 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:13,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,932 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2018-10-27 06:08:13,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:13,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:14,448 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:14,453 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:14,455 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-10-27 06:08:14,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:14,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:14,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:14,463 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,464 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-10-27 06:08:14,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,473 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-10-27 06:08:14,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,481 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-10-27 06:08:14,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,489 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-10-27 06:08:14,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:14,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:14,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:14,491 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,496 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-10-27 06:08:14,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:14,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:14,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:14,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:14,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:14,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:14,509 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:14,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:14,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:14,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,527 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,528 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-10-27 06:08:14,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,535 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,536 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-10-27 06:08:14,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,544 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,545 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-10-27 06:08:14,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,552 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,552 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-10-27 06:08:14,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,561 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-10-27 06:08:14,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,562 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:14,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,566 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:14,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,576 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,577 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-10-27 06:08:14,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,586 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-10-27 06:08:14,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,594 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,594 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-10-27 06:08:14,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,630 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,655 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:14,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:14,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:14,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:14,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:14,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:14,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:14,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:14,670 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:14,677 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:14,677 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:08:14,679 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:14,681 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:14,681 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:14,682 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 + 19 Supporting invariants [] [2018-10-27 06:08:14,728 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2018-10-27 06:08:14,734 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:14,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:14,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:14,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:14,912 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:14,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-10-27 06:08:14,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-10-27 06:08:14,943 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:15,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:15,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:15,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-10-27 06:08:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:15,163 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-10-27 06:08:15,163 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 27 transitions. cyclomatic complexity: 2 Second operand 7 states. [2018-10-27 06:08:15,337 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 27 transitions. cyclomatic complexity: 2. Second operand 7 states. Result 48 states and 51 transitions. Complement of second has 13 states. [2018-10-27 06:08:15,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-10-27 06:08:15,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 13 letters. Loop has 8 letters. [2018-10-27 06:08:15,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:15,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 21 letters. Loop has 8 letters. [2018-10-27 06:08:15,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:15,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 13 letters. Loop has 16 letters. [2018-10-27 06:08:15,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:15,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 51 transitions. [2018-10-27 06:08:15,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:15,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 45 states and 48 transitions. [2018-10-27 06:08:15,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-10-27 06:08:15,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-10-27 06:08:15,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 48 transitions. [2018-10-27 06:08:15,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:15,346 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-10-27 06:08:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 48 transitions. [2018-10-27 06:08:15,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-10-27 06:08:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-27 06:08:15,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-10-27 06:08:15,354 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-10-27 06:08:15,354 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-10-27 06:08:15,354 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:08:15,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 45 transitions. [2018-10-27 06:08:15,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:15,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:15,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:15,356 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:15,356 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:15,358 INFO L793 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 314#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 315#L550 SUMMARY for call write~int(0, main_~i~0.base, main_~i~0.offset, 4); srcloc: L550 333#L550-1 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L550-1 334#L552-3 assume true; 343#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 342#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 341#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 340#L553-1 main_#t~post6 := main_#t~mem5; 339#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 338#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 337#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 336#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 335#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 328#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 348#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 347#L553-1 main_#t~post6 := main_#t~mem5; 346#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 345#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 309#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 310#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 307#L555 [2018-10-27 06:08:15,358 INFO L795 eck$LassoCheckResult]: Loop: 307#L555 SUMMARY for call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L555 308#L555-1 main_#t~post9 := main_#t~mem8; 313#L555-2 SUMMARY for call write~int(main_#t~post9 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L555-2 321#L555-3 havoc main_#t~post9;havoc main_#t~mem8; 329#L552-3 assume true; 325#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 326#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 316#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 317#L553-1 main_#t~post6 := main_#t~mem5; 323#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 330#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 332#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 344#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 307#L555 [2018-10-27 06:08:15,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:15,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1570409926, now seen corresponding path program 1 times [2018-10-27 06:08:15,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:15,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:15,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:15,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:15,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:15,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:15,529 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:15,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:15,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:15,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:15,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:08:15,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:15,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:15,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:08:15,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:08:15,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:15,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:15,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-10-27 06:08:15,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:15,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:08:15,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:15,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:15,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:15,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:15,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:15,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:15,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 06:08:15,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:15,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:08:15,986 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,997 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 06:08:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:16,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:16,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2018-10-27 06:08:16,018 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:16,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:16,018 INFO L82 PathProgramCache]: Analyzing trace with hash -957315855, now seen corresponding path program 2 times [2018-10-27 06:08:16,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:16,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:16,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:16,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:16,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 06:08:16,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-10-27 06:08:16,165 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. cyclomatic complexity: 5 Second operand 22 states. [2018-10-27 06:08:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:16,548 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-10-27 06:08:16,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 06:08:16,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 68 transitions. [2018-10-27 06:08:16,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:16,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 58 states and 61 transitions. [2018-10-27 06:08:16,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-10-27 06:08:16,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-10-27 06:08:16,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 61 transitions. [2018-10-27 06:08:16,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:16,558 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-10-27 06:08:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 61 transitions. [2018-10-27 06:08:16,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2018-10-27 06:08:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-27 06:08:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-10-27 06:08:16,563 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-10-27 06:08:16,563 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-10-27 06:08:16,563 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:08:16,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2018-10-27 06:08:16,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:16,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:16,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:16,564 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:16,565 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:16,565 INFO L793 eck$LassoCheckResult]: Stem: 540#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 530#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 531#L550 SUMMARY for call write~int(0, main_~i~0.base, main_~i~0.offset, 4); srcloc: L550 551#L550-1 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L550-1 553#L552-3 assume true; 561#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 560#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 559#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 558#L553-1 main_#t~post6 := main_#t~mem5; 557#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 556#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 555#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 536#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 537#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 541#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 534#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 535#L553-1 main_#t~post6 := main_#t~mem5; 544#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 547#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 527#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 528#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 538#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 542#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 564#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 563#L553-1 main_#t~post6 := main_#t~mem5; 562#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 549#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 550#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 554#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 523#L555 [2018-10-27 06:08:16,565 INFO L795 eck$LassoCheckResult]: Loop: 523#L555 SUMMARY for call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L555 524#L555-1 main_#t~post9 := main_#t~mem8; 529#L555-2 SUMMARY for call write~int(main_#t~post9 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L555-2 539#L555-3 havoc main_#t~post9;havoc main_#t~mem8; 545#L552-3 assume true; 552#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 548#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 532#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 533#L553-1 main_#t~post6 := main_#t~mem5; 543#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 546#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 525#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 526#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 523#L555 [2018-10-27 06:08:16,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:16,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1705343548, now seen corresponding path program 2 times [2018-10-27 06:08:16,565 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:16,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:16,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:16,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:16,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:16,799 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:16,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:08:16,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:08:16,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:16,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:16,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:16,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:08:16,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:16,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:16,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:08:16,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:08:16,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:16,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:16,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-10-27 06:08:17,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:17,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:08:17,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:17,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:17,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:17,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:17,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:17,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:17,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:17,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:17,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:17,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:17,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:17,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:17,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:17,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:17,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:17,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:17,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 06:08:17,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:08:17,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:17,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:17,360 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:17,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:17,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:17,366 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 06:08:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:17,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:17,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 28 [2018-10-27 06:08:17,386 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:17,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:17,387 INFO L82 PathProgramCache]: Analyzing trace with hash -957315855, now seen corresponding path program 3 times [2018-10-27 06:08:17,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:17,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:17,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:17,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-27 06:08:17,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2018-10-27 06:08:17,509 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 29 states. [2018-10-27 06:08:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:18,067 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-10-27 06:08:18,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 06:08:18,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 76 transitions. [2018-10-27 06:08:18,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:18,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 66 states and 69 transitions. [2018-10-27 06:08:18,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-10-27 06:08:18,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-10-27 06:08:18,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 69 transitions. [2018-10-27 06:08:18,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:18,072 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-10-27 06:08:18,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 69 transitions. [2018-10-27 06:08:18,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2018-10-27 06:08:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-27 06:08:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-10-27 06:08:18,076 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-10-27 06:08:18,076 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-10-27 06:08:18,077 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:08:18,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2018-10-27 06:08:18,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:18,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:18,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:18,080 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:18,081 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:18,081 INFO L793 eck$LassoCheckResult]: Stem: 804#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 795#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 796#L550 SUMMARY for call write~int(0, main_~i~0.base, main_~i~0.offset, 4); srcloc: L550 815#L550-1 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L550-1 817#L552-3 assume true; 826#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 825#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 824#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 823#L553-1 main_#t~post6 := main_#t~mem5; 822#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 821#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 791#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 792#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 802#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 808#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 837#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 836#L553-1 main_#t~post6 := main_#t~mem5; 835#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 834#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 833#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 832#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 809#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 810#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 799#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 800#L553-1 main_#t~post6 := main_#t~mem5; 806#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 813#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 793#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 794#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 803#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 811#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 797#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 798#L553-1 main_#t~post6 := main_#t~mem5; 805#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 812#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 814#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 818#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 788#L555 [2018-10-27 06:08:18,081 INFO L795 eck$LassoCheckResult]: Loop: 788#L555 SUMMARY for call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L555 789#L555-1 main_#t~post9 := main_#t~mem8; 790#L555-2 SUMMARY for call write~int(main_#t~post9 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L555-2 801#L555-3 havoc main_#t~post9;havoc main_#t~mem8; 807#L552-3 assume true; 816#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 831#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 830#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 829#L553-1 main_#t~post6 := main_#t~mem5; 828#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 827#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 819#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 820#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 788#L555 [2018-10-27 06:08:18,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:18,081 INFO L82 PathProgramCache]: Analyzing trace with hash -831492274, now seen corresponding path program 3 times [2018-10-27 06:08:18,081 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:18,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:18,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:18,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:18,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:18,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:18,784 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:18,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:08:18,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 06:08:18,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:18,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:18,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:18,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:18,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:18,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:08:18,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:18,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:18,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:18,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:18,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:18,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:08:18,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:08:18,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:18,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:18,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:18,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:18,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-10-27 06:08:18,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:18,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:08:18,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:19,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:19,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:19,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:19,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:19,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:19,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:19,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:19,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:19,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:19,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:19,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:19,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:19,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:19,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:19,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:19,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:19,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:19,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:19,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:19,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:19,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:19,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 06:08:19,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:19,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:19,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:08:19,535 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:19,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:19,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:19,538 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 06:08:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:19,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:19,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 35 [2018-10-27 06:08:19,559 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:19,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:19,559 INFO L82 PathProgramCache]: Analyzing trace with hash -957315855, now seen corresponding path program 4 times [2018-10-27 06:08:19,559 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:19,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:19,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:19,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:19,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:19,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-27 06:08:19,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1020, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 06:08:19,644 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. cyclomatic complexity: 4 Second operand 36 states. [2018-10-27 06:08:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:20,181 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-10-27 06:08:20,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 06:08:20,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 84 transitions. [2018-10-27 06:08:20,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:20,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 74 states and 77 transitions. [2018-10-27 06:08:20,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-10-27 06:08:20,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-10-27 06:08:20,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 77 transitions. [2018-10-27 06:08:20,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:20,184 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-10-27 06:08:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 77 transitions. [2018-10-27 06:08:20,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2018-10-27 06:08:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-27 06:08:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-10-27 06:08:20,187 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-10-27 06:08:20,187 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-10-27 06:08:20,187 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:08:20,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 60 transitions. [2018-10-27 06:08:20,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:20,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:20,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:20,193 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:20,193 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:20,193 INFO L793 eck$LassoCheckResult]: Stem: 1126#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1117#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1118#L550 SUMMARY for call write~int(0, main_~i~0.base, main_~i~0.offset, 4); srcloc: L550 1138#L550-1 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L550-1 1140#L552-3 assume true; 1153#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1151#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1149#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1147#L553-1 main_#t~post6 := main_#t~mem5; 1145#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1144#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1112#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1113#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1119#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1127#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1160#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1159#L553-1 main_#t~post6 := main_#t~mem5; 1135#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1136#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1114#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1115#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1120#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1161#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1167#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1166#L553-1 main_#t~post6 := main_#t~mem5; 1165#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1164#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1163#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1162#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1128#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1129#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1123#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1124#L553-1 main_#t~post6 := main_#t~mem5; 1131#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1158#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1157#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1156#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1155#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1133#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1121#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1122#L553-1 main_#t~post6 := main_#t~mem5; 1130#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1134#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1137#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1141#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 1110#L555 [2018-10-27 06:08:20,193 INFO L795 eck$LassoCheckResult]: Loop: 1110#L555 SUMMARY for call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L555 1111#L555-1 main_#t~post9 := main_#t~mem8; 1116#L555-2 SUMMARY for call write~int(main_#t~post9 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L555-2 1125#L555-3 havoc main_#t~post9;havoc main_#t~mem8; 1132#L552-3 assume true; 1139#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1154#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1152#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1150#L553-1 main_#t~post6 := main_#t~mem5; 1148#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1146#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1142#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1143#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 1110#L555 [2018-10-27 06:08:20,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:20,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1399926488, now seen corresponding path program 4 times [2018-10-27 06:08:20,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:20,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:20,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:20,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:20,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:20,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:20,481 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:20,502 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:08:20,528 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:08:20,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:20,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:20,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:20,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:20,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:20,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:08:20,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:20,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:20,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:20,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:20,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:20,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:08:20,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:08:20,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:20,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:20,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:20,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:20,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-10-27 06:08:20,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:20,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:08:20,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:20,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:20,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:20,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:20,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:20,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:20,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:20,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:20,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:20,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:20,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:20,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:20,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:20,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:20,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:20,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:20,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:21,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:21,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:21,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:21,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:21,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:21,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:21,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:21,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 06:08:21,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:21,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:08:21,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,124 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 06:08:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:21,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:21,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 42 [2018-10-27 06:08:21,147 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:21,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:21,147 INFO L82 PathProgramCache]: Analyzing trace with hash -957315855, now seen corresponding path program 5 times [2018-10-27 06:08:21,147 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:21,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:21,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:21,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:21,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:21,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-27 06:08:21,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1474, Unknown=0, NotChecked=0, Total=1806 [2018-10-27 06:08:21,244 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. cyclomatic complexity: 4 Second operand 43 states. [2018-10-27 06:08:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:22,052 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-10-27 06:08:22,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-27 06:08:22,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 92 transitions. [2018-10-27 06:08:22,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:22,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 82 states and 85 transitions. [2018-10-27 06:08:22,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-10-27 06:08:22,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-10-27 06:08:22,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 85 transitions. [2018-10-27 06:08:22,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:22,055 INFO L705 BuchiCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-10-27 06:08:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 85 transitions. [2018-10-27 06:08:22,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2018-10-27 06:08:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-27 06:08:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-10-27 06:08:22,058 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-10-27 06:08:22,058 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-10-27 06:08:22,058 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:08:22,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 68 transitions. [2018-10-27 06:08:22,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:22,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:22,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:22,061 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:22,061 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:22,061 INFO L793 eck$LassoCheckResult]: Stem: 1505#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1496#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1497#L550 SUMMARY for call write~int(0, main_~i~0.base, main_~i~0.offset, 4); srcloc: L550 1518#L550-1 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L550-1 1519#L552-3 assume true; 1533#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1531#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1529#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1527#L553-1 main_#t~post6 := main_#t~mem5; 1525#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1524#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1491#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1492#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1498#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1506#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1554#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1553#L553-1 main_#t~post6 := main_#t~mem5; 1514#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1515#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1517#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1551#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1507#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1508#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1502#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1503#L553-1 main_#t~post6 := main_#t~mem5; 1510#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1552#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1493#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1494#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1499#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1550#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1549#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1548#L553-1 main_#t~post6 := main_#t~mem5; 1547#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1546#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1545#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1544#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1543#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1536#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1542#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1541#L553-1 main_#t~post6 := main_#t~mem5; 1540#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1539#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1538#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1537#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1535#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1512#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1500#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1501#L553-1 main_#t~post6 := main_#t~mem5; 1509#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1513#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1516#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1521#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 1489#L555 [2018-10-27 06:08:22,061 INFO L795 eck$LassoCheckResult]: Loop: 1489#L555 SUMMARY for call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L555 1490#L555-1 main_#t~post9 := main_#t~mem8; 1495#L555-2 SUMMARY for call write~int(main_#t~post9 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L555-2 1504#L555-3 havoc main_#t~post9;havoc main_#t~mem8; 1511#L552-3 assume true; 1520#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1534#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1532#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1530#L553-1 main_#t~post6 := main_#t~mem5; 1528#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1526#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1522#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1523#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 1489#L555 [2018-10-27 06:08:22,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:22,062 INFO L82 PathProgramCache]: Analyzing trace with hash -735656862, now seen corresponding path program 5 times [2018-10-27 06:08:22,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:22,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:22,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:22,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:22,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:22,403 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:22,410 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:08:22,432 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-27 06:08:22,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:22,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:22,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:22,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:08:22,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:22,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:22,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:08:22,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:08:22,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:22,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:22,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-10-27 06:08:22,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:22,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:08:22,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:22,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:22,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:22,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:22,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:22,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:22,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:22,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:22,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:23,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:23,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:23,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:23,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:23,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:23,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:23,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:23,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:23,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:23,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:23,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:23,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:23,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:23,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 06:08:23,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:23,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:08:23,812 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,817 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 06:08:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:23,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:23,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23] total 49 [2018-10-27 06:08:23,844 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:23,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:23,844 INFO L82 PathProgramCache]: Analyzing trace with hash -957315855, now seen corresponding path program 6 times [2018-10-27 06:08:23,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:23,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:23,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:23,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:24,056 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-27 06:08:24,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-27 06:08:24,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=2011, Unknown=0, NotChecked=0, Total=2450 [2018-10-27 06:08:24,079 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. cyclomatic complexity: 4 Second operand 50 states. [2018-10-27 06:08:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:25,375 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-10-27 06:08:25,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-27 06:08:25,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 100 transitions. [2018-10-27 06:08:25,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:25,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 90 states and 93 transitions. [2018-10-27 06:08:25,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-10-27 06:08:25,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-10-27 06:08:25,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 93 transitions. [2018-10-27 06:08:25,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:25,378 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-10-27 06:08:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 93 transitions. [2018-10-27 06:08:25,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2018-10-27 06:08:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-27 06:08:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-10-27 06:08:25,382 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-10-27 06:08:25,382 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-10-27 06:08:25,383 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:08:25,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 76 transitions. [2018-10-27 06:08:25,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:25,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:25,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:25,384 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:25,384 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:25,384 INFO L793 eck$LassoCheckResult]: Stem: 1942#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1932#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1933#L550 SUMMARY for call write~int(0, main_~i~0.base, main_~i~0.offset, 4); srcloc: L550 1955#L550-1 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L550-1 1956#L552-3 assume true; 1966#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1965#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1964#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1963#L553-1 main_#t~post6 := main_#t~mem5; 1962#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1961#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1927#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1928#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1938#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1945#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1998#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1997#L553-1 main_#t~post6 := main_#t~mem5; 1996#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1995#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1929#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1930#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1946#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1947#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1936#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1937#L553-1 main_#t~post6 := main_#t~mem5; 1944#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1951#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1954#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1939#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1940#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1994#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1993#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1992#L553-1 main_#t~post6 := main_#t~mem5; 1991#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1990#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1989#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1988#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1987#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1986#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1985#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1984#L553-1 main_#t~post6 := main_#t~mem5; 1983#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1982#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1981#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1980#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1979#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1972#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1978#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1977#L553-1 main_#t~post6 := main_#t~mem5; 1976#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1975#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1974#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1973#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1971#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1970#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1969#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1968#L553-1 main_#t~post6 := main_#t~mem5; 1967#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1952#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1953#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1958#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 1925#L555 [2018-10-27 06:08:25,384 INFO L795 eck$LassoCheckResult]: Loop: 1925#L555 SUMMARY for call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L555 1926#L555-1 main_#t~post9 := main_#t~mem8; 1931#L555-2 SUMMARY for call write~int(main_#t~post9 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L555-2 1941#L555-3 havoc main_#t~post9;havoc main_#t~mem8; 1948#L552-3 assume true; 1957#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 1949#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 1934#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 1935#L553-1 main_#t~post6 := main_#t~mem5; 1943#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 1950#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 1959#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1960#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 1925#L555 [2018-10-27 06:08:25,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:25,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1856294932, now seen corresponding path program 6 times [2018-10-27 06:08:25,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:25,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:25,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:25,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:25,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:25,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:25,755 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:25,762 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:08:25,818 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-27 06:08:25,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:25,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:25,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:25,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:08:25,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:25,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:25,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:08:25,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:08:25,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:25,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:25,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-10-27 06:08:25,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:25,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:08:25,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:25,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:26,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:26,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:26,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:26,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:26,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:26,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:26,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:26,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:26,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:26,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:26,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:26,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:26,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:26,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:26,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:26,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:26,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:26,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:26,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:26,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:26,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:26,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:26,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:26,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:26,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 06:08:26,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:26,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:08:26,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,655 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 06:08:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:26,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:26,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 26] total 56 [2018-10-27 06:08:26,682 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:26,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:26,682 INFO L82 PathProgramCache]: Analyzing trace with hash -957315855, now seen corresponding path program 7 times [2018-10-27 06:08:26,682 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:26,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:26,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:26,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-27 06:08:26,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=2631, Unknown=0, NotChecked=0, Total=3192 [2018-10-27 06:08:26,738 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. cyclomatic complexity: 4 Second operand 57 states. [2018-10-27 06:08:27,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:27,930 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-10-27 06:08:27,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-27 06:08:27,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 108 transitions. [2018-10-27 06:08:27,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:27,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 98 states and 101 transitions. [2018-10-27 06:08:27,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-10-27 06:08:27,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-10-27 06:08:27,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 101 transitions. [2018-10-27 06:08:27,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:27,933 INFO L705 BuchiCegarLoop]: Abstraction has 98 states and 101 transitions. [2018-10-27 06:08:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 101 transitions. [2018-10-27 06:08:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2018-10-27 06:08:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-27 06:08:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-10-27 06:08:27,939 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-10-27 06:08:27,939 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-10-27 06:08:27,939 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:08:27,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 84 transitions. [2018-10-27 06:08:27,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:27,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:27,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:27,940 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:27,940 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:27,940 INFO L793 eck$LassoCheckResult]: Stem: 2434#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2425#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 2426#L550 SUMMARY for call write~int(0, main_~i~0.base, main_~i~0.offset, 4); srcloc: L550 2447#L550-1 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L550-1 2449#L552-3 assume true; 2458#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 2457#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 2456#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 2455#L553-1 main_#t~post6 := main_#t~mem5; 2454#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 2453#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 2420#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 2421#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2431#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 2437#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 2499#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 2498#L553-1 main_#t~post6 := main_#t~mem5; 2497#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 2496#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 2422#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 2423#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2432#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 2438#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 2429#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 2430#L553-1 main_#t~post6 := main_#t~mem5; 2436#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 2442#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 2446#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 2495#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2494#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 2493#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 2492#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 2491#L553-1 main_#t~post6 := main_#t~mem5; 2490#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 2489#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 2488#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 2487#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2486#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 2485#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 2484#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 2483#L553-1 main_#t~post6 := main_#t~mem5; 2482#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 2481#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 2480#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 2479#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2478#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 2477#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 2476#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 2475#L553-1 main_#t~post6 := main_#t~mem5; 2474#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 2473#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 2472#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 2471#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2470#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 2463#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 2469#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 2468#L553-1 main_#t~post6 := main_#t~mem5; 2467#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 2466#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 2465#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 2464#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2462#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 2443#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 2427#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 2428#L553-1 main_#t~post6 := main_#t~mem5; 2435#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 2444#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 2445#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 2450#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 2418#L555 [2018-10-27 06:08:27,941 INFO L795 eck$LassoCheckResult]: Loop: 2418#L555 SUMMARY for call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L555 2419#L555-1 main_#t~post9 := main_#t~mem8; 2424#L555-2 SUMMARY for call write~int(main_#t~post9 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L555-2 2433#L555-3 havoc main_#t~post9;havoc main_#t~mem8; 2439#L552-3 assume true; 2448#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 2461#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 2460#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 2459#L553-1 main_#t~post6 := main_#t~mem5; 2440#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 2441#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 2451#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 2452#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 2418#L555 [2018-10-27 06:08:27,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:27,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1641574774, now seen corresponding path program 7 times [2018-10-27 06:08:27,941 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:27,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:27,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:27,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:27,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:28,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:28,346 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:28,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:28,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:28,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:28,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:28,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:28,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:08:28,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:28,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:28,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:28,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:28,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:28,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:08:28,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:08:28,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:28,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:28,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:28,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:28,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-10-27 06:08:28,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:28,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:08:28,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:28,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:28,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:28,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:28,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:28,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:28,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:28,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:28,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:28,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:29,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:29,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:29,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:29,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:29,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:29,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:29,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:29,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:29,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:29,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:29,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:29,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:29,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:29,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:29,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:29,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:29,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:29,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:29,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:29,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:29,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:29,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:29,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:29,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:29,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 06:08:29,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:08:29,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:29,550 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,556 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 06:08:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:29,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:29,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 29] total 63 [2018-10-27 06:08:29,586 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:29,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:29,587 INFO L82 PathProgramCache]: Analyzing trace with hash -957315855, now seen corresponding path program 8 times [2018-10-27 06:08:29,587 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:29,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:29,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:29,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:29,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-27 06:08:29,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=698, Invalid=3334, Unknown=0, NotChecked=0, Total=4032 [2018-10-27 06:08:29,648 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. cyclomatic complexity: 4 Second operand 64 states. [2018-10-27 06:08:30,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:30,882 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2018-10-27 06:08:30,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-27 06:08:30,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 116 transitions. [2018-10-27 06:08:30,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:30,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 106 states and 109 transitions. [2018-10-27 06:08:30,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-10-27 06:08:30,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-10-27 06:08:30,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 109 transitions. [2018-10-27 06:08:30,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:30,885 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 109 transitions. [2018-10-27 06:08:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 109 transitions. [2018-10-27 06:08:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2018-10-27 06:08:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-27 06:08:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-10-27 06:08:30,889 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-10-27 06:08:30,889 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-10-27 06:08:30,889 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:08:30,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 92 transitions. [2018-10-27 06:08:30,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:30,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:30,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:30,891 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:30,891 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:30,891 INFO L793 eck$LassoCheckResult]: Stem: 2984#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2975#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 2976#L550 SUMMARY for call write~int(0, main_~i~0.base, main_~i~0.offset, 4); srcloc: L550 2998#L550-1 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L550-1 3000#L552-3 assume true; 3009#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3008#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3007#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3006#L553-1 main_#t~post6 := main_#t~mem5; 3005#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3004#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 2970#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 2971#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2981#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 2985#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 2979#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 2980#L553-1 main_#t~post6 := main_#t~mem5; 2990#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3055#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3054#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3053#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2986#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 2987#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3057#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3056#L553-1 main_#t~post6 := main_#t~mem5; 2994#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 2995#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 2972#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 2973#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2982#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3052#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3051#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3050#L553-1 main_#t~post6 := main_#t~mem5; 3049#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3048#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3047#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3046#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 3045#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3044#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3043#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3042#L553-1 main_#t~post6 := main_#t~mem5; 3041#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3040#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3039#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3038#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 3037#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3036#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3035#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3034#L553-1 main_#t~post6 := main_#t~mem5; 3033#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3032#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3031#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3030#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 3029#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3028#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3027#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3026#L553-1 main_#t~post6 := main_#t~mem5; 3025#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3024#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3023#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3022#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 3021#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3013#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3020#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3019#L553-1 main_#t~post6 := main_#t~mem5; 3018#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3017#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3016#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3015#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 3012#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 2992#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 2977#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 2978#L553-1 main_#t~post6 := main_#t~mem5; 3010#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 2996#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 2997#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3001#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 2968#L555 [2018-10-27 06:08:30,891 INFO L795 eck$LassoCheckResult]: Loop: 2968#L555 SUMMARY for call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L555 2969#L555-1 main_#t~post9 := main_#t~mem8; 2974#L555-2 SUMMARY for call write~int(main_#t~post9 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L555-2 2983#L555-3 havoc main_#t~post9;havoc main_#t~mem8; 2991#L552-3 assume true; 2999#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3011#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3014#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 2988#L553-1 main_#t~post6 := main_#t~mem5; 2989#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 2993#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3002#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3003#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 2968#L555 [2018-10-27 06:08:30,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1301772032, now seen corresponding path program 8 times [2018-10-27 06:08:30,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:30,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:30,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:30,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:31,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:31,565 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:31,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:08:31,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:08:31,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:31,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:31,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:31,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:08:31,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:31,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:31,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:08:31,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:08:31,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:31,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:31,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-10-27 06:08:31,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:31,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:08:31,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:31,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:31,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:31,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:31,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:31,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:31,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:31,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:31,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:31,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:32,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:32,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:32,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:32,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:32,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:32,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:32,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:32,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:32,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:32,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:32,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:32,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:32,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:32,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:32,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:32,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:32,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:32,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:32,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:32,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:32,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:32,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:32,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:32,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:32,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 06:08:32,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:08:32,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:32,695 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,699 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 06:08:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:32,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:32,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 32] total 70 [2018-10-27 06:08:32,731 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:32,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:32,732 INFO L82 PathProgramCache]: Analyzing trace with hash -957315855, now seen corresponding path program 9 times [2018-10-27 06:08:32,732 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:32,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:32,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:32,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-27 06:08:32,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=850, Invalid=4120, Unknown=0, NotChecked=0, Total=4970 [2018-10-27 06:08:32,794 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. cyclomatic complexity: 4 Second operand 71 states. [2018-10-27 06:08:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:34,609 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2018-10-27 06:08:34,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-27 06:08:34,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 124 transitions. [2018-10-27 06:08:34,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:34,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 114 states and 117 transitions. [2018-10-27 06:08:34,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-10-27 06:08:34,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-10-27 06:08:34,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 117 transitions. [2018-10-27 06:08:34,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:34,612 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 117 transitions. [2018-10-27 06:08:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 117 transitions. [2018-10-27 06:08:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2018-10-27 06:08:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-27 06:08:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-10-27 06:08:34,615 INFO L728 BuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-10-27 06:08:34,615 INFO L608 BuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-10-27 06:08:34,616 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-10-27 06:08:34,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2018-10-27 06:08:34,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:34,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:34,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:34,623 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:34,623 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:34,623 INFO L793 eck$LassoCheckResult]: Stem: 3591#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3582#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 3583#L550 SUMMARY for call write~int(0, main_~i~0.base, main_~i~0.offset, 4); srcloc: L550 3603#L550-1 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L550-1 3606#L552-3 assume true; 3616#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3615#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3614#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3613#L553-1 main_#t~post6 := main_#t~mem5; 3612#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3611#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3577#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3578#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 3588#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3592#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3586#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3587#L553-1 main_#t~post6 := main_#t~mem5; 3597#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3670#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3669#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3668#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 3593#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3594#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3672#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3671#L553-1 main_#t~post6 := main_#t~mem5; 3601#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3602#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3579#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3580#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 3589#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3667#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3666#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3665#L553-1 main_#t~post6 := main_#t~mem5; 3664#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3663#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3662#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3661#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 3660#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3659#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3658#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3657#L553-1 main_#t~post6 := main_#t~mem5; 3656#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3655#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3654#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3653#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 3652#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3651#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3650#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3649#L553-1 main_#t~post6 := main_#t~mem5; 3648#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3647#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3646#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3645#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 3644#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3643#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3642#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3641#L553-1 main_#t~post6 := main_#t~mem5; 3640#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3639#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3638#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3637#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 3636#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3635#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3634#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3633#L553-1 main_#t~post6 := main_#t~mem5; 3632#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3631#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3630#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3629#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 3628#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3619#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3627#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3626#L553-1 main_#t~post6 := main_#t~mem5; 3625#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3624#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3623#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3622#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 3618#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3599#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3584#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3585#L553-1 main_#t~post6 := main_#t~mem5; 3617#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3604#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3605#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3608#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 3575#L555 [2018-10-27 06:08:34,623 INFO L795 eck$LassoCheckResult]: Loop: 3575#L555 SUMMARY for call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L555 3576#L555-1 main_#t~post9 := main_#t~mem8; 3581#L555-2 SUMMARY for call write~int(main_#t~post9 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L555-2 3590#L555-3 havoc main_#t~post9;havoc main_#t~mem8; 3598#L552-3 assume true; 3607#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 3620#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 3621#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 3595#L553-1 main_#t~post6 := main_#t~mem5; 3596#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 3600#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 3609#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 3610#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 3575#L555 [2018-10-27 06:08:34,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:34,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2049608054, now seen corresponding path program 9 times [2018-10-27 06:08:34,624 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:34,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:34,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:34,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:34,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:35,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:35,187 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1af28832-bf0c-419e-a816-5f4b97d2580d/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:35,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:08:35,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-27 06:08:35,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:35,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:35,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:35,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:08:35,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:35,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:35,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:08:35,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:08:35,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:35,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:35,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-10-27 06:08:35,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:35,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:08:35,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:35,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:35,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:35,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:35,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:35,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:35,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:35,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:35,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:35,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:35,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:35,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:35,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:35,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:36,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:36,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:36,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:36,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:36,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:36,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:36,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:36,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:36,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:36,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:36,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:36,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:36,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:36,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:36,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:36,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:36,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:36,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:36,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:36,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:36,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:08:36,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 [2018-10-27 06:08:36,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:36,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-10-27 06:08:36,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-27 06:08:36,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:36,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:08:36,589 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,593 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 06:08:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:36,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:36,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 35] total 77 [2018-10-27 06:08:36,634 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:36,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,634 INFO L82 PathProgramCache]: Analyzing trace with hash -957315855, now seen corresponding path program 10 times [2018-10-27 06:08:36,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:36,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:36,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:36,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-27 06:08:36,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1017, Invalid=4989, Unknown=0, NotChecked=0, Total=6006 [2018-10-27 06:08:36,696 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. cyclomatic complexity: 4 Second operand 78 states. [2018-10-27 06:08:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:38,354 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-10-27 06:08:38,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-27 06:08:38,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 132 transitions. [2018-10-27 06:08:38,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:38,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 122 states and 125 transitions. [2018-10-27 06:08:38,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-10-27 06:08:38,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-10-27 06:08:38,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 125 transitions. [2018-10-27 06:08:38,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:38,357 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 125 transitions. [2018-10-27 06:08:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 125 transitions. [2018-10-27 06:08:38,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2018-10-27 06:08:38,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-27 06:08:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-10-27 06:08:38,364 INFO L728 BuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-10-27 06:08:38,365 INFO L608 BuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-10-27 06:08:38,365 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-10-27 06:08:38,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 108 transitions. [2018-10-27 06:08:38,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:08:38,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:38,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:38,366 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:38,366 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:38,367 INFO L793 eck$LassoCheckResult]: Stem: 4255#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4246#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 4247#L550 SUMMARY for call write~int(0, main_~i~0.base, main_~i~0.offset, 4); srcloc: L550 4267#L550-1 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L550-1 4269#L552-3 assume true; 4282#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 4280#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 4278#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 4276#L553-1 main_#t~post6 := main_#t~mem5; 4274#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 4273#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 4241#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 4242#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 4248#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 4256#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 4252#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 4253#L553-1 main_#t~post6 := main_#t~mem5; 4260#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 4342#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 4341#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 4340#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 4257#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 4258#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 4344#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 4343#L553-1 main_#t~post6 := main_#t~mem5; 4264#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 4265#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 4243#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 4244#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 4249#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 4339#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 4338#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 4337#L553-1 main_#t~post6 := main_#t~mem5; 4336#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 4335#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 4334#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 4333#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 4332#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 4331#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 4330#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 4329#L553-1 main_#t~post6 := main_#t~mem5; 4328#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 4327#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 4326#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 4325#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 4324#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 4323#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 4322#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 4321#L553-1 main_#t~post6 := main_#t~mem5; 4320#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 4319#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 4318#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 4317#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 4316#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 4315#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 4314#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 4313#L553-1 main_#t~post6 := main_#t~mem5; 4312#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 4311#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 4310#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 4309#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 4308#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 4307#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 4306#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 4305#L553-1 main_#t~post6 := main_#t~mem5; 4304#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 4303#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 4302#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 4301#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 4300#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 4299#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 4298#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 4297#L553-1 main_#t~post6 := main_#t~mem5; 4296#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 4295#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 4294#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 4293#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 4292#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 4285#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 4291#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 4290#L553-1 main_#t~post6 := main_#t~mem5; 4289#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 4288#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 4287#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 4286#L554-1 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 4284#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 4262#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 4250#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 4251#L553-1 main_#t~post6 := main_#t~mem5; 4259#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 4263#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 4266#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 4270#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 4239#L555 [2018-10-27 06:08:38,367 INFO L795 eck$LassoCheckResult]: Loop: 4239#L555 SUMMARY for call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L555 4240#L555-1 main_#t~post9 := main_#t~mem8; 4245#L555-2 SUMMARY for call write~int(main_#t~post9 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L555-2 4254#L555-3 havoc main_#t~post9;havoc main_#t~mem8; 4261#L552-3 assume true; 4268#L554-2 SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 4283#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4; 4281#L553 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 4279#L553-1 main_#t~post6 := main_#t~mem5; 4277#L553-2 SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L553-2 4275#L553-3 havoc main_#t~post6;havoc main_#t~mem5; 4271#L554 SUMMARY for call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 4272#L554-1 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7; 4239#L555 [2018-10-27 06:08:38,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:38,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1961441812, now seen corresponding path program 10 times [2018-10-27 06:08:38,367 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:38,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:38,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:38,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:38,415 INFO L82 PathProgramCache]: Analyzing trace with hash -957315855, now seen corresponding path program 11 times [2018-10-27 06:08:38,416 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:38,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:38,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:38,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:38,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1472954814, now seen corresponding path program 1 times [2018-10-27 06:08:38,425 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:38,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:38,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:38,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:38,592 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-27 06:09:05,328 WARN L179 SmtUtils]: Spent 26.72 s on a formula simplification. DAG size of input: 268 DAG size of output: 240 [2018-10-27 06:09:05,385 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:05,385 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:05,385 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:05,385 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:05,385 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:05,385 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:05,385 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:05,385 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:05,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca_true-termination.c.i_Iteration12_Lasso [2018-10-27 06:09:05,385 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:05,385 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:05,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:05,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:05,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:05,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:05,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:05,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:05,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:05,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:05,552 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2018-10-27 06:09:05,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-10-27 06:09:05,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:05,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:05,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:05,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:05,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-10-27 06:09:05,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:05,925 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:05,926 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:05,926 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-10-27 06:09:05,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:05,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:05,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:05,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:05,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:05,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:05,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:05,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:05,936 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-10-27 06:09:05,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:05,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:05,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:05,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:05,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:05,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:05,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:05,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:05,937 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-10-27 06:09:05,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:05,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:05,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:05,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:05,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:05,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:05,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:05,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:05,939 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-10-27 06:09:05,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:05,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:05,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:05,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:05,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:05,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:05,941 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:05,941 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-10-27 06:09:05,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:05,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:05,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:05,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:05,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:05,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:05,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:05,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:05,943 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-10-27 06:09:05,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:05,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:05,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:05,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:05,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:05,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:05,957 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:05,958 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-10-27 06:09:05,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:05,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:05,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:05,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:05,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:05,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:05,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:05,961 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-10-27 06:09:05,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:05,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:05,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:05,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:05,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:05,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:05,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:05,963 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-10-27 06:09:05,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:05,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:05,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:05,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:05,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:05,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:05,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:05,966 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-10-27 06:09:05,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:05,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:05,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:05,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:05,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:05,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:05,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:05,983 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-10-27 06:09:05,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:05,984 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:05,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:05,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:05,985 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:05,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:05,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:05,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-10-27 06:09:05,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:05,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:05,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:05,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:05,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:05,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:06,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:06,005 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-10-27 06:09:06,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:06,006 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:06,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:06,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:06,007 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:06,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:06,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:06,010 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-10-27 06:09:06,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:06,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:06,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:06,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:06,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:06,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:06,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:06,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-10-27 06:09:06,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:06,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:06,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:06,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:06,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:06,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:06,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:06,036 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-10-27 06:09:06,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:06,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:06,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:06,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:06,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:06,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:06,047 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:06,053 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:09:06,054 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:09:06,054 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:06,054 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:06,055 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:06,055 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2 + 39 Supporting invariants [] [2018-10-27 06:09:06,342 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:09:06,343 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:09:06,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:06,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:06,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:06,446 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:06,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 50 [2018-10-27 06:09:06,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-10-27 06:09:06,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:06,481 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:06,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 48 [2018-10-27 06:09:06,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-27 06:09:06,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-27 06:09:06,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 06:09:06,531 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:32, output treesize:29 [2018-10-27 06:09:06,598 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:06,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-10-27 06:09:06,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-10-27 06:09:06,601 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:06,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:06,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:06,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-10-27 06:09:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:06,625 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-10-27 06:09:06,626 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 108 transitions. cyclomatic complexity: 4 Second operand 10 states. [2018-10-27 06:09:06,689 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 108 transitions. cyclomatic complexity: 4. Second operand 10 states. Result 120 states and 124 transitions. Complement of second has 16 states. [2018-10-27 06:09:06,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:09:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2018-10-27 06:09:06,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 29 transitions. Stem has 93 letters. Loop has 13 letters. [2018-10-27 06:09:06,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:06,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 29 transitions. Stem has 106 letters. Loop has 13 letters. [2018-10-27 06:09:06,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:06,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 29 transitions. Stem has 93 letters. Loop has 26 letters. [2018-10-27 06:09:06,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:06,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 124 transitions. [2018-10-27 06:09:06,693 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:09:06,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 0 states and 0 transitions. [2018-10-27 06:09:06,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:09:06,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:09:06,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:09:06,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:06,694 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:06,694 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:06,694 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:06,694 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-10-27 06:09:06,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:09:06,694 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:09:06,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:09:06,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:09:06 BoogieIcfgContainer [2018-10-27 06:09:06,707 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:09:06,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:09:06,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:09:06,710 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:09:06,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:11" (3/4) ... [2018-10-27 06:09:06,713 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:09:06,713 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:09:06,714 INFO L168 Benchmark]: Toolchain (without parser) took 56345.83 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 428.3 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -114.3 MB). Peak memory consumption was 314.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:06,714 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:09:06,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.58 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 928.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:06,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 928.9 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:06,715 INFO L168 Benchmark]: Boogie Preprocessor took 24.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:09:06,715 INFO L168 Benchmark]: RCFGBuilder took 470.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:06,715 INFO L168 Benchmark]: BuchiAutomizer took 55380.72 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 325.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 333.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:06,715 INFO L168 Benchmark]: Witness Printer took 3.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:09:06,725 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 364.58 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 928.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 928.9 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 470.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 55380.72 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 325.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 333.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[i][i] + 19 and consists of 7 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[i][i] + 39 and consists of 9 locations. 10 modules have a trivial ranking function, the largest among these consists of 78 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 55.3s and 13 iterations. TraceHistogramMax:11. Analysis of lassos took 44.1s. Construction of modules took 2.4s. Büchi inclusion checks took 8.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 152 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 106 states and ocurred in iteration 11. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 109 SDtfs, 1279 SDslu, 1409 SDs, 0 SdLazy, 3122 SolverSat, 500 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU9 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital255 mio100 ax107 hnf100 lsp89 ukn63 mio100 lsp40 div100 bol100 ite100 ukn100 eq189 hnf88 smp91 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 2 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...