./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/NonTermination3-2.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_861a57fe-6c52-4db5-963d-f43f09d97504/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NonTermination3-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/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 b10c0555613e3e1e99ee574b69e31152fe0aa7f9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 23:49:26,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:49:26,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:49:26,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:49:26,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:49:26,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:49:26,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:49:26,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:49:26,114 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:49:26,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:49:26,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:49:26,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:49:26,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:49:26,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:49:26,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:49:26,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:49:26,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:49:26,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:49:26,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:49:26,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:49:26,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:49:26,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:49:26,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:49:26,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:49:26,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:49:26,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:49:26,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:49:26,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:49:26,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:49:26,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:49:26,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:49:26,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:49:26,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:49:26,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:49:26,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:49:26,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:49:26,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:49:26,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:49:26,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:49:26,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:49:26,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:49:26,141 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:49:26,156 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:49:26,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:49:26,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:49:26,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:49:26,158 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:49:26,158 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:49:26,158 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:49:26,159 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:49:26,159 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:49:26,159 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:49:26,159 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:49:26,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:49:26,160 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:49:26,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:49:26,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:49:26,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:49:26,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:49:26,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:49:26,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:49:26,162 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:49:26,162 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:49:26,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:49:26,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:49:26,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:49:26,163 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:49:26,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:49:26,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:49:26,163 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:49:26,164 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:49:26,165 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_861a57fe-6c52-4db5-963d-f43f09d97504/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 -> b10c0555613e3e1e99ee574b69e31152fe0aa7f9 [2019-11-15 23:49:26,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:49:26,201 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:49:26,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:49:26,208 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:49:26,210 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:49:26,211 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2019-11-15 23:49:26,274 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/bin/uautomizer/data/d472242ba/15f8a4c98b1c478197c775d9e02f5b7a/FLAG9fc781b83 [2019-11-15 23:49:26,696 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:49:26,697 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2019-11-15 23:49:26,703 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/bin/uautomizer/data/d472242ba/15f8a4c98b1c478197c775d9e02f5b7a/FLAG9fc781b83 [2019-11-15 23:49:26,719 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/bin/uautomizer/data/d472242ba/15f8a4c98b1c478197c775d9e02f5b7a [2019-11-15 23:49:26,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:49:26,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:49:26,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:49:26,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:49:26,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:49:26,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:49:26" (1/1) ... [2019-11-15 23:49:26,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b554028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:26, skipping insertion in model container [2019-11-15 23:49:26,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:49:26" (1/1) ... [2019-11-15 23:49:26,742 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:49:26,759 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:49:26,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:49:26,996 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:49:27,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:49:27,026 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:49:27,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:27 WrapperNode [2019-11-15 23:49:27,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:49:27,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:49:27,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:49:27,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:49:27,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:27" (1/1) ... [2019-11-15 23:49:27,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:27" (1/1) ... [2019-11-15 23:49:27,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:49:27,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:49:27,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:49:27,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:49:27,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:27" (1/1) ... [2019-11-15 23:49:27,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:27" (1/1) ... [2019-11-15 23:49:27,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:27" (1/1) ... [2019-11-15 23:49:27,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:27" (1/1) ... [2019-11-15 23:49:27,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:27" (1/1) ... [2019-11-15 23:49:27,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:27" (1/1) ... [2019-11-15 23:49:27,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:27" (1/1) ... [2019-11-15 23:49:27,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:49:27,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:49:27,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:49:27,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:49:27,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/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 23:49:27,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:49:27,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:49:27,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:49:27,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:49:27,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:49:27,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:49:27,402 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:49:27,402 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 23:49:27,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:49:27 BoogieIcfgContainer [2019-11-15 23:49:27,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:49:27,404 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:49:27,404 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:49:27,408 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:49:27,409 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:49:27,409 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:49:26" (1/3) ... [2019-11-15 23:49:27,410 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d2e404f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:49:27, skipping insertion in model container [2019-11-15 23:49:27,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:49:27,411 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:27" (2/3) ... [2019-11-15 23:49:27,411 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d2e404f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:49:27, skipping insertion in model container [2019-11-15 23:49:27,411 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:49:27,411 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:49:27" (3/3) ... [2019-11-15 23:49:27,413 INFO L371 chiAutomizerObserver]: Analyzing ICFG NonTermination3-2.c [2019-11-15 23:49:27,460 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:49:27,461 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:49:27,461 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:49:27,461 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:49:27,463 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:49:27,464 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:49:27,464 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:49:27,464 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:49:27,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 23:49:27,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:49:27,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:49:27,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:49:27,506 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:49:27,507 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:49:27,507 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:49:27,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 23:49:27,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:49:27,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:49:27,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:49:27,509 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:49:27,510 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:49:27,517 INFO L791 eck$LassoCheckResult]: Stem: 7#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 23:49:27,518 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; 8#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 23:49:27,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:27,524 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 23:49:27,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:27,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231287310] [2019-11-15 23:49:27,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:27,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:27,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:27,676 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:27,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:27,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-15 23:49:27,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:27,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867573850] [2019-11-15 23:49:27,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:27,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:27,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:27,696 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:27,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:27,698 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-15 23:49:27,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:27,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706486652] [2019-11-15 23:49:27,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:27,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:27,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:27,737 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:27,943 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:49:27,944 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:49:27,944 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:49:27,944 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:49:27,944 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:49:27,944 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:49:27,945 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:49:27,945 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:49:27,945 INFO L131 ssoRankerPreferences]: Filename of dumped script: NonTermination3-2.c_Iteration1_Lasso [2019-11-15 23:49:27,945 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:49:27,946 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:49:27,971 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 23:49:27,982 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 23:49:27,985 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 23:49:28,055 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 23:49:28,058 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 23:49:28,061 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 23:49:28,065 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 23:49:28,069 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 23:49:28,072 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 23:49:28,079 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 23:49:28,317 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:49:28,324 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:49:28,327 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 23:49:28,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:28,329 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:28,330 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:28,330 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:28,330 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:28,334 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:28,334 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:28,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:28,341 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 23:49:28,343 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:28,343 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:28,343 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:28,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:28,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:28,345 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:28,345 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:28,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:28,349 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 23:49:28,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:28,352 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:28,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:28,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:28,362 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:28,362 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:28,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:28,400 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 23:49:28,404 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:28,420 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:28,420 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:28,420 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:28,422 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:28,422 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:28,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:28,427 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 23:49:28,428 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:28,428 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:49:28,428 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:28,429 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:28,431 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:49:28,431 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:28,442 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:28,450 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 23:49:28,453 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:28,453 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:28,453 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:28,453 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:28,454 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:28,454 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:28,454 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:28,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:28,456 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 23:49:28,456 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:28,456 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:49:28,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:28,457 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:28,457 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:28,457 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:49:28,458 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:49:28,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:49:28,461 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 23:49:28,462 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:49:28,463 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:49:28,464 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:49:28,464 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:49:28,468 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:49:28,468 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:49:28,534 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:49:28,570 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 23:49:28,570 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:49:28,572 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:49:28,574 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:49:28,574 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:49:28,575 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 23:49:28,584 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 23:49:28,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:28,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:49:28,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:28,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:49:28,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:28,657 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 23:49:28,672 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 23:49:28,674 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2019-11-15 23:49:28,718 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 23:49:28,719 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 23:49:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:49:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-11-15 23:49:28,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-15 23:49:28,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:49:28,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 23:49:28,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:49:28,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 23:49:28,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:49:28,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2019-11-15 23:49:28,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:28,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2019-11-15 23:49:28,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:49:28,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 23:49:28,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-11-15 23:49:28,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:49:28,734 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-15 23:49:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-11-15 23:49:28,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-15 23:49:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:49:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-11-15 23:49:28,760 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-11-15 23:49:28,760 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-11-15 23:49:28,760 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:49:28,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2019-11-15 23:49:28,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:28,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:49:28,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:49:28,761 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:49:28,761 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:49:28,762 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 23:49:28,762 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;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 83#L17-4 [2019-11-15 23:49:28,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:28,762 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2019-11-15 23:49:28,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:28,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105120833] [2019-11-15 23:49:28,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:28,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:28,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:28,798 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 23:49:28,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105120833] [2019-11-15 23:49:28,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:28,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:49:28,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100924445] [2019-11-15 23:49:28,802 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:49:28,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:28,802 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2019-11-15 23:49:28,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:28,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10466852] [2019-11-15 23:49:28,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:28,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:28,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:28,821 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:28,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:28,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:49:28,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:49:28,930 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 23:49:28,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:28,942 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-11-15 23:49:28,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:49:28,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-11-15 23:49:28,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:28,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2019-11-15 23:49:28,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:49:28,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:49:28,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-11-15 23:49:28,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:49:28,945 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-15 23:49:28,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-11-15 23:49:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-15 23:49:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:49:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-11-15 23:49:28,947 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-15 23:49:28,947 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-15 23:49:28,947 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:49:28,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-11-15 23:49:28,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:28,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:49:28,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:49:28,948 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:49:28,948 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:49:28,949 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 23:49:28,949 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;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 108#L17-4 [2019-11-15 23:49:28,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2019-11-15 23:49:28,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:28,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437130667] [2019-11-15 23:49:28,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:28,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:28,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:28,978 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 23:49:28,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437130667] [2019-11-15 23:49:28,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348073140] [2019-11-15 23:49:28,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/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 23:49:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:29,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:49:29,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:29,034 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 23:49:29,035 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:29,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-11-15 23:49:29,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801448609] [2019-11-15 23:49:29,035 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:49:29,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:29,036 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2019-11-15 23:49:29,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:29,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011857759] [2019-11-15 23:49:29,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:29,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:29,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:29,065 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:29,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:29,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:49:29,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:49:29,187 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-11-15 23:49:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:29,205 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-11-15 23:49:29,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:49:29,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-11-15 23:49:29,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:29,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-11-15 23:49:29,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:49:29,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:49:29,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-11-15 23:49:29,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:49:29,207 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-11-15 23:49:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-11-15 23:49:29,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-15 23:49:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 23:49:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-11-15 23:49:29,209 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-15 23:49:29,209 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-15 23:49:29,209 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:49:29,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-11-15 23:49:29,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:29,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:49:29,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:49:29,210 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2019-11-15 23:49:29,210 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:49:29,210 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 23:49:29,211 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;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 147#L17-4 [2019-11-15 23:49:29,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:29,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2019-11-15 23:49:29,211 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:29,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417337643] [2019-11-15 23:49:29,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:29,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:29,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:29,252 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 23:49:29,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417337643] [2019-11-15 23:49:29,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496706016] [2019-11-15 23:49:29,253 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/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 23:49:29,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:49:29,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:49:29,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:49:29,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:29,309 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 23:49:29,310 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:29,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-15 23:49:29,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634982513] [2019-11-15 23:49:29,310 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:49:29,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:29,311 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2019-11-15 23:49:29,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:29,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894095608] [2019-11-15 23:49:29,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:29,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:29,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:29,329 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:29,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:29,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:49:29,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:49:29,447 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-11-15 23:49:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:29,473 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-11-15 23:49:29,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:49:29,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-11-15 23:49:29,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:29,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2019-11-15 23:49:29,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:49:29,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:49:29,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-11-15 23:49:29,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:49:29,477 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-15 23:49:29,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-11-15 23:49:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-15 23:49:29,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 23:49:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-11-15 23:49:29,478 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-15 23:49:29,479 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-15 23:49:29,479 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:49:29,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2019-11-15 23:49:29,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:29,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:49:29,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:49:29,480 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2019-11-15 23:49:29,480 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:49:29,481 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 23:49:29,481 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;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 195#L17-4 [2019-11-15 23:49:29,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:29,481 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2019-11-15 23:49:29,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:29,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119277587] [2019-11-15 23:49:29,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:29,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:29,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:29,545 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 23:49:29,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119277587] [2019-11-15 23:49:29,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836459629] [2019-11-15 23:49:29,545 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/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 23:49:29,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 23:49:29,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:49:29,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:49:29,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:29,613 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 23:49:29,613 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:29,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-15 23:49:29,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645853200] [2019-11-15 23:49:29,614 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:49:29,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:29,614 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2019-11-15 23:49:29,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:29,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56068953] [2019-11-15 23:49:29,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:29,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:29,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:29,631 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:29,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:29,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:49:29,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:49:29,758 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-11-15 23:49:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:29,786 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-15 23:49:29,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:49:29,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-11-15 23:49:29,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:29,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2019-11-15 23:49:29,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:49:29,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:49:29,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2019-11-15 23:49:29,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:49:29,789 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 23:49:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2019-11-15 23:49:29,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-15 23:49:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 23:49:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-15 23:49:29,791 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 23:49:29,791 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 23:49:29,791 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:49:29,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-11-15 23:49:29,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:29,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:49:29,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:49:29,793 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2019-11-15 23:49:29,793 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:49:29,793 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 23:49:29,794 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;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 258#L17-4 [2019-11-15 23:49:29,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:29,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2019-11-15 23:49:29,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:29,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217067885] [2019-11-15 23:49:29,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:29,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:29,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:29,865 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 23:49:29,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217067885] [2019-11-15 23:49:29,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129783875] [2019-11-15 23:49:29,866 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/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 23:49:29,926 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:49:29,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:49:29,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:49:29,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:29,939 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 23:49:29,939 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:29,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 23:49:29,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174159330] [2019-11-15 23:49:29,953 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:49:29,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:29,954 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2019-11-15 23:49:29,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:29,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109668089] [2019-11-15 23:49:29,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:29,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:29,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:29,964 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:30,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:30,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:49:30,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:49:30,077 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2019-11-15 23:49:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:30,115 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-11-15 23:49:30,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:49:30,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-11-15 23:49:30,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:30,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2019-11-15 23:49:30,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:49:30,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:49:30,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-11-15 23:49:30,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:49:30,118 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 23:49:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-11-15 23:49:30,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-15 23:49:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 23:49:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-11-15 23:49:30,120 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-15 23:49:30,120 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-15 23:49:30,120 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:49:30,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2019-11-15 23:49:30,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:30,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:49:30,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:49:30,121 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2019-11-15 23:49:30,121 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:49:30,122 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 23:49:30,122 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;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 328#L17-4 [2019-11-15 23:49:30,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:30,122 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2019-11-15 23:49:30,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:30,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146409636] [2019-11-15 23:49:30,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:30,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:30,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:30,217 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 23:49:30,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146409636] [2019-11-15 23:49:30,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21408082] [2019-11-15 23:49:30,218 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/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 23:49:30,275 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-15 23:49:30,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:49:30,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:49:30,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:30,294 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 23:49:30,295 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:30,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-15 23:49:30,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991573151] [2019-11-15 23:49:30,295 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:49:30,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:30,296 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2019-11-15 23:49:30,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:30,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339107190] [2019-11-15 23:49:30,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:30,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:30,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:30,305 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:30,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:30,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:49:30,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:49:30,390 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-11-15 23:49:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:30,420 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-11-15 23:49:30,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:49:30,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2019-11-15 23:49:30,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:30,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2019-11-15 23:49:30,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:49:30,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:49:30,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2019-11-15 23:49:30,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:49:30,423 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-15 23:49:30,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2019-11-15 23:49:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-15 23:49:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 23:49:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-15 23:49:30,425 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-15 23:49:30,425 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-15 23:49:30,425 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:49:30,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-11-15 23:49:30,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:30,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:49:30,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:49:30,427 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2019-11-15 23:49:30,427 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:49:30,427 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 23:49:30,427 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;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 413#L17-4 [2019-11-15 23:49:30,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:30,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2019-11-15 23:49:30,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:30,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246279968] [2019-11-15 23:49:30,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:30,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:30,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:30,495 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 23:49:30,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246279968] [2019-11-15 23:49:30,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746747850] [2019-11-15 23:49:30,495 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/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 23:49:30,545 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-15 23:49:30,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:49:30,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:49:30,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:30,564 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 23:49:30,565 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:30,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-15 23:49:30,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988829017] [2019-11-15 23:49:30,566 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:49:30,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:30,566 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2019-11-15 23:49:30,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:30,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169277623] [2019-11-15 23:49:30,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:30,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:30,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:30,576 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:30,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:30,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:49:30,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:49:30,674 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2019-11-15 23:49:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:30,720 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-11-15 23:49:30,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:49:30,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2019-11-15 23:49:30,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:30,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2019-11-15 23:49:30,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:49:30,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:49:30,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2019-11-15 23:49:30,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:49:30,724 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-15 23:49:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2019-11-15 23:49:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-15 23:49:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 23:49:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-11-15 23:49:30,725 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-15 23:49:30,725 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-15 23:49:30,726 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 23:49:30,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2019-11-15 23:49:30,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:30,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:49:30,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:49:30,727 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2019-11-15 23:49:30,727 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:49:30,727 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 23:49:30,727 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;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 507#L17-4 [2019-11-15 23:49:30,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:30,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2019-11-15 23:49:30,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:30,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456325045] [2019-11-15 23:49:30,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:30,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:30,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:30,854 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 23:49:30,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456325045] [2019-11-15 23:49:30,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209683119] [2019-11-15 23:49:30,855 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/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 23:49:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:30,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:49:30,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:30,915 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 23:49:30,916 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:30,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-15 23:49:30,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586323310] [2019-11-15 23:49:30,917 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:49:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2019-11-15 23:49:30,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:30,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987225597] [2019-11-15 23:49:30,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:30,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:30,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:30,936 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:31,053 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-11-15 23:49:31,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:31,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:49:31,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:49:31,074 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2019-11-15 23:49:31,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:31,115 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-11-15 23:49:31,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:49:31,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2019-11-15 23:49:31,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:31,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2019-11-15 23:49:31,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:49:31,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:49:31,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-11-15 23:49:31,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:49:31,117 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-15 23:49:31,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-11-15 23:49:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-15 23:49:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 23:49:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-15 23:49:31,119 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-15 23:49:31,119 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-15 23:49:31,119 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 23:49:31,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2019-11-15 23:49:31,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:31,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:49:31,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:49:31,120 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2019-11-15 23:49:31,120 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:49:31,120 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 23:49:31,120 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;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 610#L17-4 [2019-11-15 23:49:31,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:31,121 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2019-11-15 23:49:31,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:31,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545212906] [2019-11-15 23:49:31,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:31,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:31,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:31,226 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 23:49:31,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545212906] [2019-11-15 23:49:31,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132247134] [2019-11-15 23:49:31,227 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/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 23:49:31,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:49:31,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:49:31,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:49:31,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:31,316 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 23:49:31,316 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:31,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-15 23:49:31,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058059285] [2019-11-15 23:49:31,317 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:49:31,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:31,317 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2019-11-15 23:49:31,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:31,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666304169] [2019-11-15 23:49:31,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:31,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:31,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:31,334 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:31,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:31,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:49:31,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:49:31,425 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2019-11-15 23:49:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:31,459 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-11-15 23:49:31,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:49:31,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2019-11-15 23:49:31,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:31,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2019-11-15 23:49:31,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:49:31,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:49:31,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2019-11-15 23:49:31,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:49:31,464 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-11-15 23:49:31,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2019-11-15 23:49:31,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-15 23:49:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 23:49:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-15 23:49:31,466 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-15 23:49:31,467 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-15 23:49:31,467 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 23:49:31,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2019-11-15 23:49:31,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:31,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:49:31,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:49:31,469 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2019-11-15 23:49:31,469 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:49:31,469 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 23:49:31,469 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;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 726#L17-4 [2019-11-15 23:49:31,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:31,470 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2019-11-15 23:49:31,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:31,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715549701] [2019-11-15 23:49:31,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:31,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:31,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:31,610 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 23:49:31,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715549701] [2019-11-15 23:49:31,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542206989] [2019-11-15 23:49:31,611 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/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 23:49:31,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-15 23:49:31,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:49:31,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:49:31,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:31,728 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 23:49:31,728 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:31,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-15 23:49:31,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118981425] [2019-11-15 23:49:31,729 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:49:31,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:31,730 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2019-11-15 23:49:31,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:31,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406051652] [2019-11-15 23:49:31,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:31,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:31,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:31,741 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:31,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:31,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:49:31,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:49:31,835 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2019-11-15 23:49:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:31,887 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-15 23:49:31,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:49:31,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-11-15 23:49:31,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:31,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2019-11-15 23:49:31,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:49:31,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:49:31,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2019-11-15 23:49:31,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:49:31,890 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-15 23:49:31,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2019-11-15 23:49:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-15 23:49:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 23:49:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-15 23:49:31,892 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-15 23:49:31,893 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-15 23:49:31,893 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 23:49:31,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2019-11-15 23:49:31,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:49:31,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:49:31,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:49:31,894 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2019-11-15 23:49:31,894 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:49:31,895 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 23:49:31,895 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;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 852#L17-4 [2019-11-15 23:49:31,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:31,895 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2019-11-15 23:49:31,895 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:31,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927201033] [2019-11-15 23:49:31,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:31,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:31,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:31,944 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:31,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:31,945 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2019-11-15 23:49:31,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:31,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559300333] [2019-11-15 23:49:31,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:31,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:31,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:31,966 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2019-11-15 23:49:31,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:31,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95428983] [2019-11-15 23:49:31,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:31,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:31,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:49:32,037 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:49:32,143 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-11-15 23:49:35,010 WARN L191 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 211 DAG size of output: 149 [2019-11-15 23:49:35,204 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-15 23:49:35,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:49:35 BoogieIcfgContainer [2019-11-15 23:49:35,243 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:49:35,243 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:49:35,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:49:35,244 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:49:35,244 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:49:27" (3/4) ... [2019-11-15 23:49:35,247 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 23:49:35,368 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_861a57fe-6c52-4db5-963d-f43f09d97504/bin/uautomizer/witness.graphml [2019-11-15 23:49:35,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:49:35,370 INFO L168 Benchmark]: Toolchain (without parser) took 8647.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:35,371 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:49:35,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:35,372 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:49:35,372 INFO L168 Benchmark]: Boogie Preprocessor took 30.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:35,373 INFO L168 Benchmark]: RCFGBuilder took 310.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:35,373 INFO L168 Benchmark]: BuchiAutomizer took 7838.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.0 MB). Peak memory consumption was 244.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:35,374 INFO L168 Benchmark]: Witness Printer took 125.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: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:35,377 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 299.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 310.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7838.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.0 MB). Peak memory consumption was 244.7 MB. Max. memory is 11.5 GB. * Witness Printer took 125.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: 2.0 MB). Peak memory consumption was 2.0 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.1s. 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: 14ms 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=0} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@7ab65e1=0, NULL=0, \result=0, NULL=0, n=10, i=7, a=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a79b086=7, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@12e2f820=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b8dbb77=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20073d15=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@78664c83=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] a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...