./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:58:00,046 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:58:00,048 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:58:00,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:58:00,056 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:58:00,056 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:58:00,057 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:58:00,058 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:58:00,059 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:58:00,060 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:58:00,061 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:58:00,061 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:58:00,062 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:58:00,063 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:58:00,064 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:58:00,064 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:58:00,065 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:58:00,067 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:58:00,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:58:00,069 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:58:00,070 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:58:00,071 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:58:00,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:58:00,073 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:58:00,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:58:00,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:58:00,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:58:00,075 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:58:00,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:58:00,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:58:00,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:58:00,077 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:58:00,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:58:00,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:58:00,078 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:58:00,079 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:58:00,079 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 09:58:00,088 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:58:00,089 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:58:00,090 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:58:00,090 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:58:00,090 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:58:00,090 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:58:00,090 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:58:00,090 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:58:00,090 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:58:00,091 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:58:00,091 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:58:00,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:58:00,091 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:58:00,091 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:58:00,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:58:00,092 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:58:00,092 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:58:00,092 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:58:00,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:58:00,092 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:58:00,092 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:58:00,092 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:58:00,093 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:58:00,093 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:58:00,093 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:58:00,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:58:00,093 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:58:00,093 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:58:00,093 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:58:00,094 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:58:00,094 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:58:00,097 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:58:00,097 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_697af1e1-7166-44de-8f1a-ea74077b4281/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 [2018-11-18 09:58:00,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:58:00,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:58:00,127 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:58:00,128 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:58:00,128 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:58:00,129 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-11-18 09:58:00,165 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/bin-2019/uautomizer/data/6c78ba20e/5005dc3753c440f995b7be77f207611c/FLAGc9221e556 [2018-11-18 09:58:00,571 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:58:00,571 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-11-18 09:58:00,576 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/bin-2019/uautomizer/data/6c78ba20e/5005dc3753c440f995b7be77f207611c/FLAGc9221e556 [2018-11-18 09:58:00,585 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/bin-2019/uautomizer/data/6c78ba20e/5005dc3753c440f995b7be77f207611c [2018-11-18 09:58:00,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:58:00,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:58:00,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:58:00,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:58:00,591 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:58:00,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:58:00" (1/1) ... [2018-11-18 09:58:00,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602e9054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:00, skipping insertion in model container [2018-11-18 09:58:00,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:58:00" (1/1) ... [2018-11-18 09:58:00,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:58:00,613 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:58:00,733 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:58:00,740 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:58:00,752 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:58:00,762 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:58:00,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:00 WrapperNode [2018-11-18 09:58:00,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:58:00,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:58:00,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:58:00,763 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:58:00,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:00" (1/1) ... [2018-11-18 09:58:00,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:00" (1/1) ... [2018-11-18 09:58:00,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:58:00,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:58:00,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:58:00,832 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:58:00,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:00" (1/1) ... [2018-11-18 09:58:00,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:00" (1/1) ... [2018-11-18 09:58:00,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:00" (1/1) ... [2018-11-18 09:58:00,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:00" (1/1) ... [2018-11-18 09:58:00,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:00" (1/1) ... [2018-11-18 09:58:00,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:00" (1/1) ... [2018-11-18 09:58:00,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:00" (1/1) ... [2018-11-18 09:58:00,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:58:00,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:58:00,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:58:00,857 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:58:00,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:58:00,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 09:58:00,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 09:58:00,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:58:00,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:58:00,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:58:00,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 09:58:00,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 09:58:00,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 09:58:01,086 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:58:01,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:58:01 BoogieIcfgContainer [2018-11-18 09:58:01,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:58:01,087 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:58:01,087 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:58:01,090 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:58:01,091 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:58:01,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:58:00" (1/3) ... [2018-11-18 09:58:01,092 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b8d62fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:58:01, skipping insertion in model container [2018-11-18 09:58:01,092 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:58:01,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:00" (2/3) ... [2018-11-18 09:58:01,093 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b8d62fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:58:01, skipping insertion in model container [2018-11-18 09:58:01,093 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:58:01,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:58:01" (3/3) ... [2018-11-18 09:58:01,095 INFO L375 chiAutomizerObserver]: Analyzing ICFG test25_false-unreach-call_true-termination.c [2018-11-18 09:58:01,144 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:58:01,144 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:58:01,144 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:58:01,144 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:58:01,145 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:58:01,145 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:58:01,145 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:58:01,145 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:58:01,145 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:58:01,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 09:58:01,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 09:58:01,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:01,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:01,176 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:58:01,177 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:01,177 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:58:01,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 09:58:01,178 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 09:58:01,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:01,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:01,179 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:58:01,179 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:01,185 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 9#L24-4true [2018-11-18 09:58:01,185 INFO L796 eck$LassoCheckResult]: Loop: 9#L24-4true assume true; 16#L24-1true assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 11#L24-3true main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 9#L24-4true [2018-11-18 09:58:01,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:01,190 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 09:58:01,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:01,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:01,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:01,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:01,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:01,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:01,265 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2018-11-18 09:58:01,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:01,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:01,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:01,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:01,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:01,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:01,290 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2018-11-18 09:58:01,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:01,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:01,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:01,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:01,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:01,484 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:58:01,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:58:01,485 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:58:01,486 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:58:01,486 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:58:01,486 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:58:01,486 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:58:01,486 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:58:01,487 INFO L131 ssoRankerPreferences]: Filename of dumped script: test25_false-unreach-call_true-termination.c_Iteration1_Lasso [2018-11-18 09:58:01,487 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:58:01,487 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:58:01,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,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-11-18 09:58:01,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:01,766 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:58:01,769 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:58:01,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:01,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:01,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:01,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:01,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:01,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:01,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:01,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:01,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:01,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:01,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:01,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:01,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:01,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:01,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:01,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:01,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:01,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:01,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:01,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:01,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:01,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:01,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:01,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:01,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:01,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:01,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:01,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:01,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:01,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:01,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:01,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:01,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:58:01,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:58:01,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:01,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:01,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:01,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:01,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:01,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:01,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:01,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:01,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:01,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:01,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:01,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:01,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:01,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:01,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:01,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:01,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:01,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:01,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:01,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:01,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:01,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:01,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:01,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:01,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:58:01,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:58:01,830 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:58:01,864 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 09:58:01,864 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 09:58:01,867 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:58:01,868 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:58:01,868 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:58:01,869 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#array~0.base)_1, ULTIMATE.start_main_~j~0) = 19*v_rep(select #length ULTIMATE.start_main_~#array~0.base)_1 - 16*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-18 09:58:01,894 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 09:58:01,899 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:58:01,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:01,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:01,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:01,952 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:58:01,953 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-11-18 09:58:02,000 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 44 states and 59 transitions. Complement of second has 8 states. [2018-11-18 09:58:02,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:58:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:58:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-18 09:58:02,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 09:58:02,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:58:02,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 09:58:02,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:58:02,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 09:58:02,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:58:02,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 59 transitions. [2018-11-18 09:58:02,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:02,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 12 states and 14 transitions. [2018-11-18 09:58:02,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 09:58:02,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:58:02,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2018-11-18 09:58:02,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:58:02,013 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 09:58:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2018-11-18 09:58:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 09:58:02,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 09:58:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-11-18 09:58:02,033 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 09:58:02,033 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 09:58:02,033 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:58:02,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2018-11-18 09:58:02,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:02,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:02,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:02,034 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:58:02,034 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:02,035 INFO L794 eck$LassoCheckResult]: Stem: 124#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 117#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 118#L24-4 assume true; 126#L24-1 assume !(main_~j~0 < 10); 127#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); 121#L32 assume main_#t~mem8 > 0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 122#L34-4 [2018-11-18 09:58:02,035 INFO L796 eck$LassoCheckResult]: Loop: 122#L34-4 assume true; 125#L34-1 call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 123#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; 122#L34-4 [2018-11-18 09:58:02,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:02,035 INFO L82 PathProgramCache]: Analyzing trace with hash 889538729, now seen corresponding path program 1 times [2018-11-18 09:58:02,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:02,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:02,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:02,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:02,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:58:02,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:58:02,071 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:58:02,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:02,071 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 1 times [2018-11-18 09:58:02,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:02,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:02,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:02,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:02,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:58:02,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:58:02,103 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-18 09:58:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:58:02,110 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-18 09:58:02,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:58:02,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2018-11-18 09:58:02,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:02,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 15 transitions. [2018-11-18 09:58:02,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 09:58:02,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:58:02,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2018-11-18 09:58:02,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:58:02,112 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-18 09:58:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2018-11-18 09:58:02,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-11-18 09:58:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 09:58:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-18 09:58:02,113 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 09:58:02,113 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 09:58:02,113 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:58:02,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2018-11-18 09:58:02,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:02,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:02,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:02,114 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:58:02,114 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:02,114 INFO L794 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 151#L24-4 assume true; 161#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 152#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 153#L24-4 assume true; 159#L24-1 assume !(main_~j~0 < 10); 160#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); 155#L32 assume main_#t~mem8 > 0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 156#L34-4 [2018-11-18 09:58:02,114 INFO L796 eck$LassoCheckResult]: Loop: 156#L34-4 assume true; 158#L34-1 call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 157#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; 156#L34-4 [2018-11-18 09:58:02,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:02,114 INFO L82 PathProgramCache]: Analyzing trace with hash 351309099, now seen corresponding path program 1 times [2018-11-18 09:58:02,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:02,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:02,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:02,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:02,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:58:02,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/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-11-18 09:58:02,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:02,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:02,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:58:02,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 09:58:02,188 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:58:02,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:02,188 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 2 times [2018-11-18 09:58:02,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:02,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:02,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:02,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:02,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:58:02,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:58:02,206 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-18 09:58:02,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:58:02,220 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-18 09:58:02,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:58:02,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2018-11-18 09:58:02,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:02,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 18 transitions. [2018-11-18 09:58:02,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 09:58:02,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:58:02,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2018-11-18 09:58:02,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:58:02,222 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-18 09:58:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2018-11-18 09:58:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-11-18 09:58:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 09:58:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-18 09:58:02,224 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-18 09:58:02,224 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-18 09:58:02,224 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 09:58:02,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-18 09:58:02,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:02,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:02,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:02,225 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 09:58:02,225 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:02,225 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 212#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 213#L24-4 assume true; 225#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 214#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 215#L24-4 assume true; 223#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 224#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 226#L24-4 assume true; 221#L24-1 assume !(main_~j~0 < 10); 222#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); 217#L32 assume main_#t~mem8 > 0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 218#L34-4 [2018-11-18 09:58:02,226 INFO L796 eck$LassoCheckResult]: Loop: 218#L34-4 assume true; 220#L34-1 call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 219#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; 218#L34-4 [2018-11-18 09:58:02,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:02,226 INFO L82 PathProgramCache]: Analyzing trace with hash -934682263, now seen corresponding path program 2 times [2018-11-18 09:58:02,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:02,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:02,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:02,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:02,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:58:02,281 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/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-11-18 09:58:02,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:58:02,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:58:02,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:58:02,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:02,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:58:02,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 09:58:02,362 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:58:02,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:02,363 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 3 times [2018-11-18 09:58:02,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:02,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:02,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:02,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:02,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:58:02,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:58:02,387 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-18 09:58:02,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:58:02,403 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-18 09:58:02,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:58:02,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2018-11-18 09:58:02,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:02,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 21 transitions. [2018-11-18 09:58:02,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 09:58:02,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:58:02,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2018-11-18 09:58:02,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:58:02,405 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-18 09:58:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2018-11-18 09:58:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-11-18 09:58:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 09:58:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-18 09:58:02,407 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 09:58:02,407 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 09:58:02,407 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 09:58:02,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. [2018-11-18 09:58:02,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:02,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:02,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:02,408 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1, 1, 1] [2018-11-18 09:58:02,408 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:02,408 INFO L794 eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 290#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 291#L24-4 assume true; 302#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 307#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 303#L24-4 assume true; 301#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 292#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 293#L24-4 assume true; 305#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 306#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 304#L24-4 assume true; 299#L24-1 assume !(main_~j~0 < 10); 300#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); 297#L32 assume main_#t~mem8 > 0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 295#L34-4 [2018-11-18 09:58:02,408 INFO L796 eck$LassoCheckResult]: Loop: 295#L34-4 assume true; 298#L34-1 call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 294#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; 295#L34-4 [2018-11-18 09:58:02,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:02,408 INFO L82 PathProgramCache]: Analyzing trace with hash -795067285, now seen corresponding path program 3 times [2018-11-18 09:58:02,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:02,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:02,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:02,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:02,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:58:02,455 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/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-11-18 09:58:02,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 09:58:02,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 09:58:02,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:58:02,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:02,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:58:02,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 09:58:02,525 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:58:02,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:02,526 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 4 times [2018-11-18 09:58:02,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:02,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:02,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:02,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:02,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:58:02,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:58:02,554 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-18 09:58:02,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:58:02,587 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-18 09:58:02,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:58:02,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2018-11-18 09:58:02,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:02,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 24 transitions. [2018-11-18 09:58:02,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 09:58:02,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:58:02,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2018-11-18 09:58:02,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:58:02,589 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-18 09:58:02,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2018-11-18 09:58:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-18 09:58:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 09:58:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-18 09:58:02,594 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-18 09:58:02,594 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-18 09:58:02,594 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 09:58:02,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2018-11-18 09:58:02,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:02,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:02,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:02,599 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1, 1, 1] [2018-11-18 09:58:02,599 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:02,599 INFO L794 eck$LassoCheckResult]: Stem: 388#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 384#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 385#L24-4 assume true; 395#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 386#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 387#L24-4 assume true; 396#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 404#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 403#L24-4 assume true; 402#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 401#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 400#L24-4 assume true; 398#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 399#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 397#L24-4 assume true; 393#L24-1 assume !(main_~j~0 < 10); 394#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); 389#L32 assume main_#t~mem8 > 0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 390#L34-4 [2018-11-18 09:58:02,600 INFO L796 eck$LassoCheckResult]: Loop: 390#L34-4 assume true; 392#L34-1 call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 391#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; 390#L34-4 [2018-11-18 09:58:02,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:02,600 INFO L82 PathProgramCache]: Analyzing trace with hash 946399785, now seen corresponding path program 4 times [2018-11-18 09:58:02,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:02,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:02,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:58:02,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/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-11-18 09:58:02,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 09:58:02,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 09:58:02,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:58:02,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:02,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:58:02,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 09:58:02,702 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:58:02,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:02,702 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 5 times [2018-11-18 09:58:02,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:02,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:02,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:02,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:02,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 09:58:02,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:58:02,724 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-11-18 09:58:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:58:02,757 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-18 09:58:02,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:58:02,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2018-11-18 09:58:02,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:02,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 27 transitions. [2018-11-18 09:58:02,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 09:58:02,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:58:02,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2018-11-18 09:58:02,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:58:02,759 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-18 09:58:02,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2018-11-18 09:58:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-18 09:58:02,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 09:58:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-18 09:58:02,761 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-18 09:58:02,761 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-18 09:58:02,761 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 09:58:02,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 25 transitions. [2018-11-18 09:58:02,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:02,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:02,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:02,762 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1, 1, 1] [2018-11-18 09:58:02,762 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:02,762 INFO L794 eck$LassoCheckResult]: Stem: 498#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 494#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 495#L24-4 assume true; 505#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 496#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 497#L24-4 assume true; 506#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 517#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 516#L24-4 assume true; 515#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 514#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 513#L24-4 assume true; 512#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 511#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 510#L24-4 assume true; 508#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 509#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 507#L24-4 assume true; 503#L24-1 assume !(main_~j~0 < 10); 504#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); 499#L32 assume main_#t~mem8 > 0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 500#L34-4 [2018-11-18 09:58:02,762 INFO L796 eck$LassoCheckResult]: Loop: 500#L34-4 assume true; 502#L34-1 call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 501#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; 500#L34-4 [2018-11-18 09:58:02,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:02,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2081913771, now seen corresponding path program 5 times [2018-11-18 09:58:02,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:02,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:02,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:02,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:02,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:58:02,821 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/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-11-18 09:58:02,829 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 09:58:02,852 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 09:58:02,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:58:02,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:02,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:58:02,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 09:58:02,888 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:58:02,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:02,889 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 6 times [2018-11-18 09:58:02,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:02,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:02,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:02,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:02,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:58:02,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:58:02,928 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-11-18 09:58:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:58:02,960 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-18 09:58:02,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 09:58:02,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 31 transitions. [2018-11-18 09:58:02,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:02,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 30 transitions. [2018-11-18 09:58:02,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 09:58:02,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:58:02,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2018-11-18 09:58:02,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:58:02,962 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-18 09:58:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2018-11-18 09:58:02,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-18 09:58:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 09:58:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-18 09:58:02,964 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-18 09:58:02,964 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-18 09:58:02,964 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 09:58:02,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2018-11-18 09:58:02,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:02,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:02,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:02,965 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1, 1, 1] [2018-11-18 09:58:02,965 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:02,965 INFO L794 eck$LassoCheckResult]: Stem: 624#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 620#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 621#L24-4 assume true; 631#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 622#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 623#L24-4 assume true; 632#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 646#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 645#L24-4 assume true; 644#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 643#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 642#L24-4 assume true; 641#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 640#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 639#L24-4 assume true; 638#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 637#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 636#L24-4 assume true; 634#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 635#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 633#L24-4 assume true; 629#L24-1 assume !(main_~j~0 < 10); 630#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); 625#L32 assume main_#t~mem8 > 0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 626#L34-4 [2018-11-18 09:58:02,965 INFO L796 eck$LassoCheckResult]: Loop: 626#L34-4 assume true; 628#L34-1 call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 627#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; 626#L34-4 [2018-11-18 09:58:02,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:02,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1278319895, now seen corresponding path program 6 times [2018-11-18 09:58:02,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:02,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:02,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:02,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:03,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:58:03,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/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-11-18 09:58:03,027 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 09:58:03,074 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 09:58:03,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:58:03,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:03,086 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:03,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:58:03,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 09:58:03,102 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:58:03,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:03,102 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 7 times [2018-11-18 09:58:03,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:03,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:03,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:03,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:03,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 09:58:03,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:58:03,117 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 10 states. [2018-11-18 09:58:03,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:58:03,135 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-18 09:58:03,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 09:58:03,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 34 transitions. [2018-11-18 09:58:03,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:03,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 33 transitions. [2018-11-18 09:58:03,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 09:58:03,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:58:03,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 33 transitions. [2018-11-18 09:58:03,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:58:03,137 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-18 09:58:03,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 33 transitions. [2018-11-18 09:58:03,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-18 09:58:03,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 09:58:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-18 09:58:03,138 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-18 09:58:03,138 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-18 09:58:03,138 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 09:58:03,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 31 transitions. [2018-11-18 09:58:03,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:03,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:03,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:03,139 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 1, 1, 1, 1, 1] [2018-11-18 09:58:03,140 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:03,140 INFO L794 eck$LassoCheckResult]: Stem: 766#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 762#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 763#L24-4 assume true; 773#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 764#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 765#L24-4 assume true; 774#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 791#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 790#L24-4 assume true; 789#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 788#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 787#L24-4 assume true; 786#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 785#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 784#L24-4 assume true; 783#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 782#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 781#L24-4 assume true; 780#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 779#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 778#L24-4 assume true; 776#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 777#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 775#L24-4 assume true; 771#L24-1 assume !(main_~j~0 < 10); 772#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); 767#L32 assume main_#t~mem8 > 0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 768#L34-4 [2018-11-18 09:58:03,140 INFO L796 eck$LassoCheckResult]: Loop: 768#L34-4 assume true; 770#L34-1 call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 769#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; 768#L34-4 [2018-11-18 09:58:03,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:03,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1098271467, now seen corresponding path program 7 times [2018-11-18 09:58:03,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:03,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:03,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:03,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:03,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:58:03,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/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-11-18 09:58:03,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:03,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:03,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:58:03,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 09:58:03,256 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:58:03,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:03,256 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 8 times [2018-11-18 09:58:03,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:03,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:03,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:58:03,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:03,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 09:58:03,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:58:03,298 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. cyclomatic complexity: 3 Second operand 11 states. [2018-11-18 09:58:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:58:03,327 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-18 09:58:03,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 09:58:03,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 37 transitions. [2018-11-18 09:58:03,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:03,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 36 transitions. [2018-11-18 09:58:03,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 09:58:03,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:58:03,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 36 transitions. [2018-11-18 09:58:03,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:58:03,329 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-18 09:58:03,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 36 transitions. [2018-11-18 09:58:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-18 09:58:03,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 09:58:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-18 09:58:03,331 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-18 09:58:03,331 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-18 09:58:03,331 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 09:58:03,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 34 transitions. [2018-11-18 09:58:03,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:03,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:03,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:03,333 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1, 1, 1] [2018-11-18 09:58:03,333 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:03,333 INFO L794 eck$LassoCheckResult]: Stem: 927#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 920#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 921#L24-4 assume true; 931#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 922#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 923#L24-4 assume true; 932#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 952#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 951#L24-4 assume true; 950#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 949#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 948#L24-4 assume true; 947#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 946#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 945#L24-4 assume true; 944#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 943#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 942#L24-4 assume true; 941#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 940#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 939#L24-4 assume true; 938#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 937#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 936#L24-4 assume true; 934#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 935#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 933#L24-4 assume true; 929#L24-1 assume !(main_~j~0 < 10); 930#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); 924#L32 assume main_#t~mem8 > 0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 925#L34-4 [2018-11-18 09:58:03,333 INFO L796 eck$LassoCheckResult]: Loop: 925#L34-4 assume true; 928#L34-1 call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 926#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; 925#L34-4 [2018-11-18 09:58:03,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:03,333 INFO L82 PathProgramCache]: Analyzing trace with hash -404337751, now seen corresponding path program 8 times [2018-11-18 09:58:03,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:03,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:03,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:03,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:03,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:58:03,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/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-11-18 09:58:03,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:58:03,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:58:03,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:58:03,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:03,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:58:03,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 09:58:03,487 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:58:03,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:03,487 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 9 times [2018-11-18 09:58:03,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:03,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:03,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:03,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:03,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 09:58:03,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:58:03,527 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-18 09:58:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:58:03,571 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-18 09:58:03,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:58:03,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 40 transitions. [2018-11-18 09:58:03,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:03,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 38 states and 39 transitions. [2018-11-18 09:58:03,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 09:58:03,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:58:03,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 39 transitions. [2018-11-18 09:58:03,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:58:03,574 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-18 09:58:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 39 transitions. [2018-11-18 09:58:03,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-18 09:58:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 09:58:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-18 09:58:03,576 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-18 09:58:03,576 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-18 09:58:03,576 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 09:58:03,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 37 transitions. [2018-11-18 09:58:03,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:03,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:03,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:03,577 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 1, 1, 1, 1, 1] [2018-11-18 09:58:03,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:03,577 INFO L794 eck$LassoCheckResult]: Stem: 1101#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1094#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 1095#L24-4 assume true; 1105#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1096#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1097#L24-4 assume true; 1106#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1129#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1128#L24-4 assume true; 1127#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1126#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1125#L24-4 assume true; 1124#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1123#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1122#L24-4 assume true; 1121#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1120#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1119#L24-4 assume true; 1118#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1117#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1116#L24-4 assume true; 1115#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1114#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1113#L24-4 assume true; 1112#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1111#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1110#L24-4 assume true; 1108#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1109#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1107#L24-4 assume true; 1103#L24-1 assume !(main_~j~0 < 10); 1104#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); 1098#L32 assume main_#t~mem8 > 0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 1099#L34-4 [2018-11-18 09:58:03,578 INFO L796 eck$LassoCheckResult]: Loop: 1099#L34-4 assume true; 1102#L34-1 call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 1100#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; 1099#L34-4 [2018-11-18 09:58:03,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:03,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1808575019, now seen corresponding path program 9 times [2018-11-18 09:58:03,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:03,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:03,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:03,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:03,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:58:03,650 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697af1e1-7166-44de-8f1a-ea74077b4281/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-11-18 09:58:03,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 09:58:03,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 09:58:03,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:58:03,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:03,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:58:03,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 09:58:03,912 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:58:03,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:03,912 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 10 times [2018-11-18 09:58:03,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:03,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:03,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:03,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:03,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 09:58:03,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 09:58:03,928 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. cyclomatic complexity: 3 Second operand 13 states. [2018-11-18 09:58:03,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:58:03,956 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-18 09:58:03,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 09:58:03,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 42 transitions. [2018-11-18 09:58:03,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:03,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 41 transitions. [2018-11-18 09:58:03,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 09:58:03,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:58:03,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 41 transitions. [2018-11-18 09:58:03,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:58:03,958 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-18 09:58:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 41 transitions. [2018-11-18 09:58:03,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-18 09:58:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 09:58:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-18 09:58:03,960 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-18 09:58:03,960 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-18 09:58:03,960 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 09:58:03,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 40 transitions. [2018-11-18 09:58:03,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:58:03,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:58:03,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:58:03,961 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1, 1, 1] [2018-11-18 09:58:03,961 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:58:03,962 INFO L794 eck$LassoCheckResult]: Stem: 1289#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1283#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 1284#L24-4 assume true; 1294#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1285#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1286#L24-4 assume true; 1295#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1321#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1320#L24-4 assume true; 1319#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1318#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1317#L24-4 assume true; 1316#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1315#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1314#L24-4 assume true; 1313#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1312#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1311#L24-4 assume true; 1310#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1309#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1308#L24-4 assume true; 1307#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1306#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1305#L24-4 assume true; 1304#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1303#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1302#L24-4 assume true; 1301#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1300#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1299#L24-4 assume true; 1297#L24-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet5; 1298#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1296#L24-4 assume true; 1292#L24-1 assume !(main_~j~0 < 10); 1293#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, 4 + main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8 := read~int(main_#t~mem7.base, 4 + main_#t~mem7.offset, 4); 1290#L32 assume main_#t~mem8 > 0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 1288#L34-4 [2018-11-18 09:58:03,962 INFO L796 eck$LassoCheckResult]: Loop: 1288#L34-4 assume true; 1291#L34-1 call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 1287#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre11; 1288#L34-4 [2018-11-18 09:58:03,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:03,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1055087511, now seen corresponding path program 10 times [2018-11-18 09:58:03,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:03,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:03,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:03,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:04,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:04,007 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 11 times [2018-11-18 09:58:04,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:04,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:04,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:04,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:04,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:04,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:04,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1541342186, now seen corresponding path program 1 times [2018-11-18 09:58:04,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:58:04,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:58:04,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:04,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:58:04,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:58:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:58:45,545 WARN L180 SmtUtils]: Spent 41.45 s on a formula simplification. DAG size of input: 304 DAG size of output: 227 [2018-11-18 09:58:47,472 WARN L180 SmtUtils]: Spent 1.91 s on a formula simplification that was a NOOP. DAG size: 161 [2018-11-18 09:58:47,474 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:58:47,474 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:58:47,474 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:58:47,474 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:58:47,474 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:58:47,474 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:58:47,474 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:58:47,474 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:58:47,474 INFO L131 ssoRankerPreferences]: Filename of dumped script: test25_false-unreach-call_true-termination.c_Iteration12_Lasso [2018-11-18 09:58:47,474 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:58:47,474 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:58:47,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:47,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:47,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:47,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:47,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:47,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:47,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:47,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:47,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:48,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:48,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:48,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:48,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:48,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:48,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:48,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:48,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:58:48,182 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:58:48,183 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:58:48,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:48,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:48,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:48,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:48,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:48,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:48,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:48,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:48,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:48,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:48,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:48,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:48,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:48,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:48,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:48,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:48,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:48,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:48,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:48,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:48,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:48,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:48,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:48,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:48,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:48,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:48,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:48,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:48,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:48,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:48,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:48,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:48,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:48,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:48,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:48,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:48,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:48,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:48,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:48,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:48,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:48,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:58:48,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:58:48,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:48,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:48,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:48,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:48,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:48,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:48,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:48,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:48,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:48,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:48,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:48,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:48,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:48,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:48,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:48,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:48,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:48,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:48,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:48,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:48,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:48,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:58:48,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:48,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:48,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:48,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:58:48,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:58:48,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:48,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:48,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:48,198 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:58:48,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:48,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:48,199 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:58:48,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:58:48,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:58:48,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:58:48,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:58:48,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:58:48,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:58:48,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:58:48,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:58:48,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:58:48,209 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:58:48,218 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 09:58:48,218 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 09:58:48,218 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:58:48,219 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:58:48,219 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:58:48,219 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)_1, ULTIMATE.start_main_~i~0) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)_1 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-18 09:58:48,257 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2018-11-18 09:58:48,258 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 09:58:48,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:58:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:48,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:58:48,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:58:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:58:48,312 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:58:48,312 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 40 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-18 09:58:48,318 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 40 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 42 states and 44 transitions. Complement of second has 6 states. [2018-11-18 09:58:48,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:58:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:58:48,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-18 09:58:48,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 36 letters. Loop has 3 letters. [2018-11-18 09:58:48,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:58:48,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 39 letters. Loop has 3 letters. [2018-11-18 09:58:48,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:58:48,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 36 letters. Loop has 6 letters. [2018-11-18 09:58:48,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:58:48,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 44 transitions. [2018-11-18 09:58:48,321 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:58:48,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2018-11-18 09:58:48,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 09:58:48,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 09:58:48,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 09:58:48,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:58:48,322 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:58:48,322 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:58:48,322 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:58:48,322 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 09:58:48,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:58:48,322 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:58:48,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 09:58:48,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:58:48 BoogieIcfgContainer [2018-11-18 09:58:48,327 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:58:48,327 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:58:48,327 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:58:48,327 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:58:48,328 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:58:01" (3/4) ... [2018-11-18 09:58:48,331 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:58:48,331 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:58:48,331 INFO L168 Benchmark]: Toolchain (without parser) took 47744.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 959.2 MB in the beginning and 933.5 MB in the end (delta: 25.7 MB). Peak memory consumption was 198.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:48,332 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:58:48,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.63 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:48,333 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:48,333 INFO L168 Benchmark]: Boogie Preprocessor took 24.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:48,334 INFO L168 Benchmark]: RCFGBuilder took 229.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:48,334 INFO L168 Benchmark]: BuchiAutomizer took 47240.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 32.5 MB). Free memory was 1.1 GB in the beginning and 938.0 MB in the end (delta: 177.5 MB). Peak memory consumption was 210.0 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:48,335 INFO L168 Benchmark]: Witness Printer took 3.51 ms. Allocated memory is still 1.2 GB. Free memory was 938.0 MB in the beginning and 933.5 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:58:48,341 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.63 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 229.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 47240.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 32.5 MB). Free memory was 1.1 GB in the beginning and 938.0 MB in the end (delta: 177.5 MB). Peak memory consumption was 210.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.51 ms. Allocated memory is still 1.2 GB. Free memory was 938.0 MB in the beginning and 933.5 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 19 * unknown-#length-unknown[array] + -16 * j and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[pa][pa] + -1 * i and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 47.2s and 13 iterations. TraceHistogramMax:11. Analysis of lassos took 46.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 19 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 11. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 110 SDtfs, 79 SDslu, 300 SDs, 0 SdLazy, 197 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital229 mio100 ax100 hnf99 lsp95 ukn44 mio100 lsp53 div100 bol100 ite100 ukn100 eq160 hnf89 smp96 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 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...