./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/NonTermination3-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NonTermination3-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 76e89a58b9c6f7059fcf416ee7a1666558a3d440 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:32:04,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:32:04,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:32:04,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:32:04,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:32:04,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:32:04,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:32:04,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:32:04,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:32:04,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:32:04,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:32:04,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:32:04,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:32:04,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:32:04,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:32:04,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:32:04,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:32:04,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:32:04,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:32:04,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:32:04,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:32:04,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:32:04,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:32:04,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:32:04,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:32:04,688 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:32:04,689 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:32:04,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:32:04,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:32:04,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:32:04,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:32:04,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:32:04,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:32:04,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:32:04,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:32:04,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:32:04,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:32:04,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:32:04,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:32:04,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:32:04,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:32:04,698 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:32:04,712 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:32:04,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:32:04,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:32:04,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:32:04,714 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:32:04,714 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:32:04,714 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:32:04,715 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:32:04,715 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:32:04,715 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:32:04,715 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:32:04,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:32:04,716 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:32:04,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:32:04,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:32:04,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:32:04,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:32:04,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:32:04,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:32:04,717 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:32:04,718 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:32:04,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:32:04,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:32:04,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:32:04,719 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:32:04,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:32:04,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:32:04,719 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:32:04,720 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:32:04,720 INFO L138 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/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76e89a58b9c6f7059fcf416ee7a1666558a3d440 [2019-11-15 22:32:04,756 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:32:04,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:32:04,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:32:04,769 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:32:04,770 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:32:04,770 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2019-11-15 22:32:04,829 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/data/4c4f2312f/078c42a224a944728b3b943acef3ccec/FLAGc21831a16 [2019-11-15 22:32:05,241 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:32:05,241 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2019-11-15 22:32:05,248 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/data/4c4f2312f/078c42a224a944728b3b943acef3ccec/FLAGc21831a16 [2019-11-15 22:32:05,658 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/data/4c4f2312f/078c42a224a944728b3b943acef3ccec [2019-11-15 22:32:05,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:32:05,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:32:05,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:32:05,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:32:05,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:32:05,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:32:05" (1/1) ... [2019-11-15 22:32:05,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d076bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:05, skipping insertion in model container [2019-11-15 22:32:05,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:32:05" (1/1) ... [2019-11-15 22:32:05,676 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:32:05,690 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:32:05,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:32:05,893 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:32:05,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:32:05,925 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:32:05,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:05 WrapperNode [2019-11-15 22:32:05,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:32:05,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:32:05,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:32:05,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:32:05,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:05" (1/1) ... [2019-11-15 22:32:05,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:05" (1/1) ... [2019-11-15 22:32:05,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:32:05,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:32:05,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:32:05,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:32:05,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:05" (1/1) ... [2019-11-15 22:32:05,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:05" (1/1) ... [2019-11-15 22:32:05,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:05" (1/1) ... [2019-11-15 22:32:05,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:05" (1/1) ... [2019-11-15 22:32:05,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:05" (1/1) ... [2019-11-15 22:32:05,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:05" (1/1) ... [2019-11-15 22:32:05,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:05" (1/1) ... [2019-11-15 22:32:05,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:32:05,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:32:05,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:32:05,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:32:05,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/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 [2019-11-15 22:32:06,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:32:06,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:32:06,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:32:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:32:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:32:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:32:06,263 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:32:06,263 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 22:32:06,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:32:06 BoogieIcfgContainer [2019-11-15 22:32:06,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:32:06,265 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:32:06,265 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:32:06,268 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:32:06,272 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:32:06,273 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:32:05" (1/3) ... [2019-11-15 22:32:06,274 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@277ee0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:32:06, skipping insertion in model container [2019-11-15 22:32:06,274 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:32:06,275 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:05" (2/3) ... [2019-11-15 22:32:06,275 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@277ee0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:32:06, skipping insertion in model container [2019-11-15 22:32:06,275 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:32:06,275 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:32:06" (3/3) ... [2019-11-15 22:32:06,277 INFO L371 chiAutomizerObserver]: Analyzing ICFG NonTermination3-1.c [2019-11-15 22:32:06,337 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:32:06,338 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:32:06,338 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:32:06,338 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:32:06,338 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:32:06,339 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:32:06,339 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:32:06,339 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:32:06,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 22:32:06,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 22:32:06,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:06,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:06,376 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:32:06,376 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:06,376 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:32:06,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 22:32:06,378 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 22:32:06,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:06,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:06,379 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:32:06,379 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:32:06,386 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 5#L13-3true [2019-11-15 22:32:06,387 INFO L793 eck$LassoCheckResult]: Loop: 5#L13-3true assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 7#L13-2true main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 5#L13-3true [2019-11-15 22:32:06,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:06,391 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 22:32:06,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:06,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367631445] [2019-11-15 22:32:06,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,505 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:06,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:06,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-15 22:32:06,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:06,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634203532] [2019-11-15 22:32:06,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,524 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:06,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:06,526 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-15 22:32:06,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:06,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281533602] [2019-11-15 22:32:06,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:06,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:06,564 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:06,745 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:32:06,746 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:32:06,746 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:32:06,746 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:32:06,747 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:32:06,747 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:32:06,747 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:32:06,747 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:32:06,747 INFO L131 ssoRankerPreferences]: Filename of dumped script: NonTermination3-1.c_Iteration1_Lasso [2019-11-15 22:32:06,748 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:32:06,748 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:32:06,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:32:06,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:32:06,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:32:06,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:32:06,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:32:06,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:32:06,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:32:06,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:32:06,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:32:06,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:32:07,091 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:32:07,095 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:32:07,097 INFO L120 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 [2019-11-15 22:32:07,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:07,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:07,100 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:07,100 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:07,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:07,103 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:07,103 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:07,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:07,113 INFO L120 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 [2019-11-15 22:32:07,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:07,115 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:07,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:07,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:07,116 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:07,116 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:07,116 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:07,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:07,118 INFO L120 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 [2019-11-15 22:32:07,119 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:07,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:07,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:07,119 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:07,122 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:32:07,122 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:07,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:07,136 INFO L120 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 [2019-11-15 22:32:07,138 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:07,138 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:07,138 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:07,138 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:07,140 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:32:07,141 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:07,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:07,149 INFO L120 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 [2019-11-15 22:32:07,150 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:07,151 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:32:07,151 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:07,152 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:07,155 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:32:07,158 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:07,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:07,182 INFO L120 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 [2019-11-15 22:32:07,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:07,184 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:07,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:07,184 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:07,184 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:07,187 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:07,187 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:07,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:07,192 INFO L120 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 [2019-11-15 22:32:07,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:07,202 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:32:07,203 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:07,203 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:07,203 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:07,204 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:32:07,204 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:32:07,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:32:07,208 INFO L120 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 [2019-11-15 22:32:07,210 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:32:07,217 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:32:07,217 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:32:07,218 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:32:07,221 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:32:07,227 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:32:07,284 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:32:07,347 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 22:32:07,348 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:32:07,350 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:32:07,352 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:32:07,352 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:32:07,353 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 19 Supporting invariants [] [2019-11-15 22:32:07,359 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 22:32:07,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:07,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:32:07,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:07,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:32:07,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:07,444 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 [2019-11-15 22:32:07,446 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2019-11-15 22:32:07,488 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 28 states and 40 transitions. Complement of second has 7 states. [2019-11-15 22:32:07,488 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 [2019-11-15 22:32:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:32:07,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-11-15 22:32:07,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-15 22:32:07,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:32:07,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 22:32:07,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:32:07,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 22:32:07,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:32:07,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2019-11-15 22:32:07,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:07,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2019-11-15 22:32:07,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 22:32:07,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 22:32:07,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-11-15 22:32:07,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:07,504 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-15 22:32:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-11-15 22:32:07,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-15 22:32:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 22:32:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-11-15 22:32:07,527 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-11-15 22:32:07,528 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-11-15 22:32:07,528 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:32:07,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2019-11-15 22:32:07,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:07,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:07,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:07,530 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 22:32:07,531 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:32:07,531 INFO L791 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 84#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 85#L13-3 assume !(main_~n~0 < 10); 83#L17-4 [2019-11-15 22:32:07,532 INFO L793 eck$LassoCheckResult]: Loop: 83#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 89#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 82#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 83#L17-4 [2019-11-15 22:32:07,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:07,532 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2019-11-15 22:32:07,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:07,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28441224] [2019-11-15 22:32:07,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:07,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:07,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:07,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28441224] [2019-11-15 22:32:07,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:32:07,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:32:07,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946015481] [2019-11-15 22:32:07,597 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:07,597 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2019-11-15 22:32:07,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:07,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705237937] [2019-11-15 22:32:07,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:07,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:07,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:07,613 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:07,733 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-11-15 22:32:07,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:07,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:32:07,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:32:07,783 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 22:32:07,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:07,797 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-11-15 22:32:07,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:32:07,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-11-15 22:32:07,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:07,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2019-11-15 22:32:07,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 22:32:07,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 22:32:07,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-11-15 22:32:07,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:07,800 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-15 22:32:07,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-11-15 22:32:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-15 22:32:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 22:32:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-11-15 22:32:07,801 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-15 22:32:07,801 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-15 22:32:07,801 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:32:07,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-11-15 22:32:07,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:07,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:07,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:07,803 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:32:07,803 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:32:07,803 INFO L791 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 105#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 106#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 109#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 110#L13-3 assume !(main_~n~0 < 10); 108#L17-4 [2019-11-15 22:32:07,803 INFO L793 eck$LassoCheckResult]: Loop: 108#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 112#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 107#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 108#L17-4 [2019-11-15 22:32:07,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:07,803 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2019-11-15 22:32:07,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:07,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528607680] [2019-11-15 22:32:07,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:07,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:07,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:07,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528607680] [2019-11-15 22:32:07,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222450747] [2019-11-15 22:32:07,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:07,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:32:07,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:07,898 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:07,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-11-15 22:32:07,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134460973] [2019-11-15 22:32:07,901 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:07,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:07,903 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2019-11-15 22:32:07,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:07,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977944548] [2019-11-15 22:32:07,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:07,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:07,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:07,925 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:08,050 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-11-15 22:32:08,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:08,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:32:08,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:32:08,088 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-11-15 22:32:08,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:08,107 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-11-15 22:32:08,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:32:08,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-11-15 22:32:08,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:08,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-11-15 22:32:08,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 22:32:08,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 22:32:08,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-11-15 22:32:08,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:08,110 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-11-15 22:32:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-11-15 22:32:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-15 22:32:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 22:32:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-11-15 22:32:08,112 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-15 22:32:08,113 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-15 22:32:08,113 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:32:08,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-11-15 22:32:08,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:08,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:08,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:08,114 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2019-11-15 22:32:08,114 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:32:08,115 INFO L791 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 145#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 148#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 149#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 150#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 153#L13-3 assume !(main_~n~0 < 10); 147#L17-4 [2019-11-15 22:32:08,115 INFO L793 eck$LassoCheckResult]: Loop: 147#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 152#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 146#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 147#L17-4 [2019-11-15 22:32:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:08,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2019-11-15 22:32:08,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:08,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993344476] [2019-11-15 22:32:08,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:08,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993344476] [2019-11-15 22:32:08,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314469869] [2019-11-15 22:32:08,153 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:08,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:32:08,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:32:08,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:32:08,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:08,210 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:08,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-15 22:32:08,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148277053] [2019-11-15 22:32:08,211 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:08,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2019-11-15 22:32:08,211 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:08,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2163537] [2019-11-15 22:32:08,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:08,223 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:08,346 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-11-15 22:32:08,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:08,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:32:08,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:32:08,389 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-11-15 22:32:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:08,418 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-11-15 22:32:08,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:32:08,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-11-15 22:32:08,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:08,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2019-11-15 22:32:08,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 22:32:08,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 22:32:08,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-11-15 22:32:08,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:08,425 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-15 22:32:08,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-11-15 22:32:08,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-15 22:32:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 22:32:08,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-11-15 22:32:08,427 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-15 22:32:08,427 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-15 22:32:08,427 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:32:08,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2019-11-15 22:32:08,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:08,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:08,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:08,429 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2019-11-15 22:32:08,429 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:32:08,429 INFO L791 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 196#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 197#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 198#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 199#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 200#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 205#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 204#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 203#L13-3 assume !(main_~n~0 < 10); 195#L17-4 [2019-11-15 22:32:08,429 INFO L793 eck$LassoCheckResult]: Loop: 195#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 202#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 194#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 195#L17-4 [2019-11-15 22:32:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:08,430 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2019-11-15 22:32:08,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:08,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049668996] [2019-11-15 22:32:08,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:08,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049668996] [2019-11-15 22:32:08,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527394210] [2019-11-15 22:32:08,496 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:08,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 22:32:08,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:32:08,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:32:08,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:08,564 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:08,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-15 22:32:08,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617404156] [2019-11-15 22:32:08,565 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:08,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:08,565 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2019-11-15 22:32:08,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:08,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945575245] [2019-11-15 22:32:08,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:08,589 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:08,694 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-11-15 22:32:08,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:08,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:32:08,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:32:08,734 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-11-15 22:32:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:08,762 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-15 22:32:08,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:32:08,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-11-15 22:32:08,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:08,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2019-11-15 22:32:08,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 22:32:08,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 22:32:08,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2019-11-15 22:32:08,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:08,765 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 22:32:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2019-11-15 22:32:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-15 22:32:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 22:32:08,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-15 22:32:08,767 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 22:32:08,767 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 22:32:08,767 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:32:08,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-11-15 22:32:08,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:08,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:08,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:08,768 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2019-11-15 22:32:08,768 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:32:08,769 INFO L791 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 255#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 256#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 259#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 260#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 261#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 263#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 268#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 267#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 266#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 265#L13-3 assume !(main_~n~0 < 10); 258#L17-4 [2019-11-15 22:32:08,769 INFO L793 eck$LassoCheckResult]: Loop: 258#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 264#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 257#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 258#L17-4 [2019-11-15 22:32:08,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:08,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2019-11-15 22:32:08,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:08,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056884799] [2019-11-15 22:32:08,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:08,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056884799] [2019-11-15 22:32:08,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64817713] [2019-11-15 22:32:08,846 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:08,899 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:32:08,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:32:08,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:32:08,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:08,910 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:08,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 22:32:08,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047414830] [2019-11-15 22:32:08,911 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:08,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:08,911 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2019-11-15 22:32:08,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:08,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487522417] [2019-11-15 22:32:08,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:08,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:08,921 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:09,034 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-11-15 22:32:09,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:09,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:32:09,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:32:09,069 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2019-11-15 22:32:09,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:09,103 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-11-15 22:32:09,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:32:09,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-11-15 22:32:09,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:09,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2019-11-15 22:32:09,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 22:32:09,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 22:32:09,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-11-15 22:32:09,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:09,106 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 22:32:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-11-15 22:32:09,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-15 22:32:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 22:32:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-11-15 22:32:09,108 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-15 22:32:09,108 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-15 22:32:09,108 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:32:09,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2019-11-15 22:32:09,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:09,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:09,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:09,110 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2019-11-15 22:32:09,110 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:32:09,110 INFO L791 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 330#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 331#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 332#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 333#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 335#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 342#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 341#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 340#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 339#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 338#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 337#L13-3 assume !(main_~n~0 < 10); 328#L17-4 [2019-11-15 22:32:09,110 INFO L793 eck$LassoCheckResult]: Loop: 328#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 336#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 327#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 328#L17-4 [2019-11-15 22:32:09,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:09,110 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2019-11-15 22:32:09,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:09,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246646222] [2019-11-15 22:32:09,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:09,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246646222] [2019-11-15 22:32:09,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102718956] [2019-11-15 22:32:09,181 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:09,223 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-15 22:32:09,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:32:09,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:32:09,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:09,242 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:09,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-15 22:32:09,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169989800] [2019-11-15 22:32:09,243 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:09,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:09,243 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2019-11-15 22:32:09,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:09,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024398950] [2019-11-15 22:32:09,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,255 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:09,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:09,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:32:09,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:32:09,364 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-11-15 22:32:09,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:09,403 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-11-15 22:32:09,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:32:09,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2019-11-15 22:32:09,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:09,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2019-11-15 22:32:09,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 22:32:09,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 22:32:09,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2019-11-15 22:32:09,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:09,406 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-15 22:32:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2019-11-15 22:32:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-15 22:32:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 22:32:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-15 22:32:09,408 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-15 22:32:09,408 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-15 22:32:09,408 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 22:32:09,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-11-15 22:32:09,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:09,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:09,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:09,409 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2019-11-15 22:32:09,409 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:32:09,409 INFO L791 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 410#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 411#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 414#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 415#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 416#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 418#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 427#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 426#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 425#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 424#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 423#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 422#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 421#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 420#L13-3 assume !(main_~n~0 < 10); 413#L17-4 [2019-11-15 22:32:09,409 INFO L793 eck$LassoCheckResult]: Loop: 413#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 419#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 412#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 413#L17-4 [2019-11-15 22:32:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:09,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2019-11-15 22:32:09,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:09,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163739203] [2019-11-15 22:32:09,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:09,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163739203] [2019-11-15 22:32:09,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448156464] [2019-11-15 22:32:09,517 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:09,583 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-15 22:32:09,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:32:09,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:32:09,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:09,599 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:09,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-15 22:32:09,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642421951] [2019-11-15 22:32:09,600 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:09,602 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2019-11-15 22:32:09,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:09,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082089617] [2019-11-15 22:32:09,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,618 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:09,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:09,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:32:09,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:32:09,742 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2019-11-15 22:32:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:09,778 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-11-15 22:32:09,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:32:09,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2019-11-15 22:32:09,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:09,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2019-11-15 22:32:09,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 22:32:09,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 22:32:09,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2019-11-15 22:32:09,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:09,781 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-15 22:32:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2019-11-15 22:32:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-15 22:32:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 22:32:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-11-15 22:32:09,783 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-15 22:32:09,783 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-15 22:32:09,783 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 22:32:09,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2019-11-15 22:32:09,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:09,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:09,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:09,785 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2019-11-15 22:32:09,785 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:32:09,785 INFO L791 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 504#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 505#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 508#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 509#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 510#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 512#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 523#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 522#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 521#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 520#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 519#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 518#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 517#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 516#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 515#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 514#L13-3 assume !(main_~n~0 < 10); 507#L17-4 [2019-11-15 22:32:09,785 INFO L793 eck$LassoCheckResult]: Loop: 507#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 513#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 506#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 507#L17-4 [2019-11-15 22:32:09,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:09,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2019-11-15 22:32:09,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:09,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684018708] [2019-11-15 22:32:09,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:09,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684018708] [2019-11-15 22:32:09,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767390292] [2019-11-15 22:32:09,888 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:09,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:32:09,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:09,976 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:09,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-15 22:32:09,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855182405] [2019-11-15 22:32:09,977 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:09,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:09,977 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2019-11-15 22:32:09,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:09,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620115218] [2019-11-15 22:32:09,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:09,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:09,986 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:10,098 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-11-15 22:32:10,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:10,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:32:10,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:32:10,146 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2019-11-15 22:32:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:10,194 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-11-15 22:32:10,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:32:10,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2019-11-15 22:32:10,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:10,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2019-11-15 22:32:10,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 22:32:10,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 22:32:10,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-11-15 22:32:10,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:10,197 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-15 22:32:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-11-15 22:32:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-15 22:32:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 22:32:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-15 22:32:10,199 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-15 22:32:10,199 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-15 22:32:10,199 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 22:32:10,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2019-11-15 22:32:10,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:10,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:10,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:10,201 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2019-11-15 22:32:10,201 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:32:10,201 INFO L791 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 611#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 612#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 613#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 614#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 615#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 617#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 630#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 629#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 628#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 627#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 626#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 625#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 624#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 623#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 622#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 621#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 620#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 619#L13-3 assume !(main_~n~0 < 10); 610#L17-4 [2019-11-15 22:32:10,201 INFO L793 eck$LassoCheckResult]: Loop: 610#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 618#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 609#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 610#L17-4 [2019-11-15 22:32:10,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:10,201 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2019-11-15 22:32:10,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:10,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580085155] [2019-11-15 22:32:10,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:10,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:10,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:10,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580085155] [2019-11-15 22:32:10,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174631153] [2019-11-15 22:32:10,319 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:10,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:32:10,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:32:10,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:32:10,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:10,406 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:10,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-15 22:32:10,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458440389] [2019-11-15 22:32:10,407 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:10,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:10,407 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2019-11-15 22:32:10,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:10,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063745018] [2019-11-15 22:32:10,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:10,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:10,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:10,416 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:10,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:10,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:32:10,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:32:10,558 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2019-11-15 22:32:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:10,604 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-11-15 22:32:10,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:32:10,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2019-11-15 22:32:10,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:10,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2019-11-15 22:32:10,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 22:32:10,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 22:32:10,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2019-11-15 22:32:10,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:10,606 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-11-15 22:32:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2019-11-15 22:32:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-15 22:32:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 22:32:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-15 22:32:10,608 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-15 22:32:10,608 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-15 22:32:10,609 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 22:32:10,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2019-11-15 22:32:10,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:10,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:10,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:10,610 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2019-11-15 22:32:10,610 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:32:10,613 INFO L791 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 727#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 728#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 729#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 730#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 731#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 733#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 748#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 747#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 746#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 745#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 744#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 743#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 742#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 741#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 740#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 739#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 738#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 737#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 736#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 735#L13-3 assume !(main_~n~0 < 10); 726#L17-4 [2019-11-15 22:32:10,613 INFO L793 eck$LassoCheckResult]: Loop: 726#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 734#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 725#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 726#L17-4 [2019-11-15 22:32:10,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:10,614 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2019-11-15 22:32:10,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:10,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317830802] [2019-11-15 22:32:10,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:10,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:10,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:10,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317830802] [2019-11-15 22:32:10,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478875095] [2019-11-15 22:32:10,735 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:32:10,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-15 22:32:10,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:32:10,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:32:10,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:32:10,830 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:32:10,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-15 22:32:10,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055085450] [2019-11-15 22:32:10,831 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:32:10,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:10,831 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2019-11-15 22:32:10,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:10,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215585772] [2019-11-15 22:32:10,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:10,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:10,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:10,840 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:10,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:10,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:32:10,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:32:10,945 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2019-11-15 22:32:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:11,003 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-15 22:32:11,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:32:11,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-11-15 22:32:11,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:11,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2019-11-15 22:32:11,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 22:32:11,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 22:32:11,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2019-11-15 22:32:11,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:32:11,005 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-15 22:32:11,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2019-11-15 22:32:11,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-15 22:32:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 22:32:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-15 22:32:11,008 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-15 22:32:11,008 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-15 22:32:11,008 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 22:32:11,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2019-11-15 22:32:11,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:32:11,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:32:11,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:32:11,009 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2019-11-15 22:32:11,009 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:32:11,010 INFO L791 eck$LassoCheckResult]: Stem: 858#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 853#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 854#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 855#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 856#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 857#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 859#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 876#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 875#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 874#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 873#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 872#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 871#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 870#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 869#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 868#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 867#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 866#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 865#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 864#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 863#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 862#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 861#L13-3 assume !(main_~n~0 < 10); 852#L17-4 [2019-11-15 22:32:11,010 INFO L793 eck$LassoCheckResult]: Loop: 852#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 860#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 851#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 852#L17-4 [2019-11-15 22:32:11,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:11,010 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2019-11-15 22:32:11,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:11,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339747581] [2019-11-15 22:32:11,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:11,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:11,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:11,034 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:11,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:11,035 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2019-11-15 22:32:11,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:11,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700173260] [2019-11-15 22:32:11,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:11,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:11,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:11,042 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:11,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:11,043 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2019-11-15 22:32:11,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:11,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789145549] [2019-11-15 22:32:11,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:11,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:11,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:11,076 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:13,852 WARN L191 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 211 DAG size of output: 149 [2019-11-15 22:32:14,046 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-15 22:32:14,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:32:14 BoogieIcfgContainer [2019-11-15 22:32:14,095 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:32:14,095 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:32:14,095 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:32:14,096 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:32:14,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:32:06" (3/4) ... [2019-11-15 22:32:14,123 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 22:32:14,204 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e23367da-0020-4fe7-bfd0-58074362324a/bin/uautomizer/witness.graphml [2019-11-15 22:32:14,204 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:32:14,205 INFO L168 Benchmark]: Toolchain (without parser) took 8544.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 943.7 MB in the beginning and 1.0 GB in the end (delta: -93.3 MB). Peak memory consumption was 78.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:14,206 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:32:14,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 943.7 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:14,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.14 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:14,218 INFO L168 Benchmark]: Boogie Preprocessor took 23.47 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:14,218 INFO L168 Benchmark]: RCFGBuilder took 276.06 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:14,219 INFO L168 Benchmark]: BuchiAutomizer took 7829.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.2 MB). Peak memory consumption was 101.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:14,219 INFO L168 Benchmark]: Witness Printer took 108.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:14,222 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 943.7 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.14 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.47 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 276.06 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7829.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.2 MB). Peak memory consumption was 101.2 MB. Max. memory is 11.5 GB. * Witness Printer took 108.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (10 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * n + 19 and consists of 5 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 7.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 65 SDslu, 251 SDs, 0 SdLazy, 188 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp93 ukn60 mio100 lsp68 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=7227} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@316eb0cb=0, NULL=0, \result=0, NULL=7227, n=10, i=8, a=7226, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68795aef=8, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@109a391d=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1484fd41=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ebedd5d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@69ddc3ec=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...